./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/pthread-ext/09_fmaxsym.i -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 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:22:27,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:22:27,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:22:27,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:22:27,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:22:27,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:22:27,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:22:27,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:22:27,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:22:27,316 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:22:27,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:22:27,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:22:27,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:22:27,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:22:27,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:22:27,318 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:22:27,318 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:22:27,318 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:22:27,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:22:27,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:22:27,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:22:27,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:22:27,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:22:27,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:22:27,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:22:27,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:22:27,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:22:27,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:22:27,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:22:27,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:22:27,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:22:27,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:22:27,320 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 -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-03-09 06:22:27,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:22:27,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:22:27,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:22:27,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:22:27,534 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:22:27,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-09 06:22:28,624 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899bdf6a1/2b0557b350a04ecfac4ff488c9c7c6e8/FLAG6578f5262 [2025-03-09 06:22:28,898 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:22:28,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-09 06:22:28,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899bdf6a1/2b0557b350a04ecfac4ff488c9c7c6e8/FLAG6578f5262 [2025-03-09 06:22:28,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899bdf6a1/2b0557b350a04ecfac4ff488c9c7c6e8 [2025-03-09 06:22:28,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:22:28,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:22:28,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:22:28,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:22:28,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:22:28,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:22:28" (1/1) ... [2025-03-09 06:22:28,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e717676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:28, skipping insertion in model container [2025-03-09 06:22:28,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:22:28" (1/1) ... [2025-03-09 06:22:28,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:22:29,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:22:29,163 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:22:29,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:22:29,226 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:22:29,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29 WrapperNode [2025-03-09 06:22:29,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:22:29,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:22:29,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:22:29,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:22:29,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,253 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-03-09 06:22:29,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:22:29,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:22:29,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:22:29,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:22:29,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,269 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-03-09 06:22:29,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,273 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:22:29,277 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:22:29,277 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:22:29,277 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:22:29,277 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:22:29,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:29,304 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-09 06:22:29,307 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-09 06:22:29,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:22:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:22:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:22:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-09 06:22:29,326 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-09 06:22:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:22:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:22:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:22:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:22:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:22:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:22:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:22:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:22:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:22:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:22:29,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:22:29,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-09 06:22:29,419 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:22:29,422 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:22:29,558 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:22:29,558 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:22:29,661 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:22:29,661 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:22:29,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:22:29 BoogieIcfgContainer [2025-03-09 06:22:29,662 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:22:29,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:22:29,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:22:29,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:22:29,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:22:28" (1/3) ... [2025-03-09 06:22:29,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722f1cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:22:29, skipping insertion in model container [2025-03-09 06:22:29,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29" (2/3) ... [2025-03-09 06:22:29,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722f1cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:22:29, skipping insertion in model container [2025-03-09 06:22:29,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:22:29" (3/3) ... [2025-03-09 06:22:29,674 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-03-09 06:22:29,683 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:22:29,684 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 30 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-09 06:22:29,685 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:22:29,720 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:22:29,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 33 transitions, 70 flow [2025-03-09 06:22:29,771 INFO L124 PetriNetUnfolderBase]: 3/35 cut-off events. [2025-03-09 06:22:29,774 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:29,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-09 06:22:29,777 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 33 transitions, 70 flow [2025-03-09 06:22:29,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 33 transitions, 70 flow [2025-03-09 06:22:29,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:22:29,797 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;@16345e55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:22:29,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-09 06:22:29,802 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:22:29,803 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 06:22:29,803 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:29,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:29,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:22:29,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-09 06:22:29,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:29,808 INFO L85 PathProgramCache]: Analyzing trace with hash 243422, now seen corresponding path program 1 times [2025-03-09 06:22:29,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:29,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841484758] [2025-03-09 06:22:29,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:29,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:29,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:22:29,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:22:29,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:29,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:30,049 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-09 06:22:30,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:30,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841484758] [2025-03-09 06:22:30,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841484758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:30,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:30,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:30,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498100555] [2025-03-09 06:22:30,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:30,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:22:30,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:30,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:22:30,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:22:30,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-09 06:22:30,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:30,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:30,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-09 06:22:30,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:30,183 INFO L124 PetriNetUnfolderBase]: 24/88 cut-off events. [2025-03-09 06:22:30,184 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:30,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 88 events. 24/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 192 event pairs, 20 based on Foata normal form. 4/81 useless extension candidates. Maximal degree in co-relation 127. Up to 64 conditions per place. [2025-03-09 06:22:30,187 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 19 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-03-09 06:22:30,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 114 flow [2025-03-09 06:22:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:22:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:22:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-03-09 06:22:30,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2025-03-09 06:22:30,197 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 70 flow. Second operand 4 states and 71 transitions. [2025-03-09 06:22:30,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 114 flow [2025-03-09 06:22:30,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:22:30,202 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 90 flow [2025-03-09 06:22:30,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-03-09 06:22:30,207 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2025-03-09 06:22:30,208 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 90 flow [2025-03-09 06:22:30,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:30,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:30,208 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 06:22:30,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:22:30,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-09 06:22:30,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:30,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1337956340, now seen corresponding path program 1 times [2025-03-09 06:22:30,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:30,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903422161] [2025-03-09 06:22:30,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:30,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:30,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:30,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:30,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:30,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:30,345 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-09 06:22:30,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:30,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903422161] [2025-03-09 06:22:30,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903422161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:30,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647011198] [2025-03-09 06:22:30,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:30,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:30,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:30,347 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-09 06:22:30,349 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-09 06:22:30,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:30,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:30,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:30,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:30,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:22:30,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:30,454 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-09 06:22:30,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:22:30,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647011198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:30,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:22:30,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:22:30,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619276106] [2025-03-09 06:22:30,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:30,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:22:30,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:30,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:22:30,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:22:30,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-09 06:22:30,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-09 06:22:30,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:30,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-09 06:22:30,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:30,530 INFO L124 PetriNetUnfolderBase]: 24/87 cut-off events. [2025-03-09 06:22:30,530 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:22:30,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 87 events. 24/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 190 event pairs, 20 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 150. Up to 59 conditions per place. [2025-03-09 06:22:30,531 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 15 selfloop transitions, 6 changer transitions 0/32 dead transitions. [2025-03-09 06:22:30,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 128 flow [2025-03-09 06:22:30,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:22:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:22:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-03-09 06:22:30,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-09 06:22:30,532 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 90 flow. Second operand 6 states and 88 transitions. [2025-03-09 06:22:30,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 128 flow [2025-03-09 06:22:30,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:22:30,533 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 96 flow [2025-03-09 06:22:30,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-03-09 06:22:30,534 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-03-09 06:22:30,534 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 96 flow [2025-03-09 06:22:30,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-09 06:22:30,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:30,534 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-09 06:22:30,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 06:22:30,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:30,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-09 06:22:30,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1473026613, now seen corresponding path program 1 times [2025-03-09 06:22:30,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:30,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419988037] [2025-03-09 06:22:30,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:30,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:30,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:22:30,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:22:30,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:30,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:22:30,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:30,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419988037] [2025-03-09 06:22:30,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419988037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:30,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:30,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:30,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750418470] [2025-03-09 06:22:30,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:30,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:30,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:30,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:30,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:30,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-09 06:22:30,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:30,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:30,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-09 06:22:30,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:30,853 INFO L124 PetriNetUnfolderBase]: 24/86 cut-off events. [2025-03-09 06:22:30,853 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 06:22:30,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 86 events. 24/86 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 186 event pairs, 20 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 146. Up to 62 conditions per place. [2025-03-09 06:22:30,854 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 16 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2025-03-09 06:22:30,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 132 flow [2025-03-09 06:22:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-03-09 06:22:30,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2025-03-09 06:22:30,856 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 96 flow. Second operand 3 states and 52 transitions. [2025-03-09 06:22:30,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 132 flow [2025-03-09 06:22:30,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 110 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 06:22:30,857 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 78 flow [2025-03-09 06:22:30,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2025-03-09 06:22:30,858 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-03-09 06:22:30,858 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 78 flow [2025-03-09 06:22:30,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:30,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:30,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:30,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:22:30,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-09 06:22:30,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:30,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1760149466, now seen corresponding path program 1 times [2025-03-09 06:22:30,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:30,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675441096] [2025-03-09 06:22:30,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:30,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:30,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:30,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:30,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:30,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:30,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:30,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675441096] [2025-03-09 06:22:30,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675441096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:30,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304330109] [2025-03-09 06:22:30,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:30,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:30,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:30,939 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-09 06:22:30,941 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-09 06:22:30,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:31,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:31,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:31,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:31,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:22:31,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:31,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:22:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:31,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304330109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:22:31,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:22:31,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 06:22:31,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342389044] [2025-03-09 06:22:31,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:22:31,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:22:31,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:31,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:22:31,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:22:31,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-09 06:22:31,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 78 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-09 06:22:31,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:31,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-09 06:22:31,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:31,129 INFO L124 PetriNetUnfolderBase]: 24/90 cut-off events. [2025-03-09 06:22:31,129 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-09 06:22:31,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 90 events. 24/90 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 177 event pairs, 20 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 139. Up to 60 conditions per place. [2025-03-09 06:22:31,130 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 16 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2025-03-09 06:22:31,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 139 flow [2025-03-09 06:22:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:22:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:22:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2025-03-09 06:22:31,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2025-03-09 06:22:31,131 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 78 flow. Second operand 7 states and 102 transitions. [2025-03-09 06:22:31,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 139 flow [2025-03-09 06:22:31,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 125 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:31,132 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 104 flow [2025-03-09 06:22:31,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2025-03-09 06:22:31,133 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-03-09 06:22:31,133 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 104 flow [2025-03-09 06:22:31,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 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-09 06:22:31,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:31,133 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:31,139 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-09 06:22:31,338 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,SelfDestructingSolverStorable3 [2025-03-09 06:22:31,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-09 06:22:31,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1515559270, now seen corresponding path program 2 times [2025-03-09 06:22:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:31,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962539814] [2025-03-09 06:22:31,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:22:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:31,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 06:22:31,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-09 06:22:31,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:22:31,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 06:22:31,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:31,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962539814] [2025-03-09 06:22:31,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962539814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:31,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:31,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:31,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325543414] [2025-03-09 06:22:31,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:31,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:31,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:31,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:31,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:31,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-09 06:22:31,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-09 06:22:31,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:31,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-09 06:22:31,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:31,430 INFO L124 PetriNetUnfolderBase]: 26/97 cut-off events. [2025-03-09 06:22:31,430 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-09 06:22:31,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 97 events. 26/97 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 198 event pairs, 2 based on Foata normal form. 3/97 useless extension candidates. Maximal degree in co-relation 153. Up to 53 conditions per place. [2025-03-09 06:22:31,431 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 24 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-03-09 06:22:31,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 158 flow [2025-03-09 06:22:31,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-09 06:22:31,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-09 06:22:31,432 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 104 flow. Second operand 3 states and 55 transitions. [2025-03-09 06:22:31,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 158 flow [2025-03-09 06:22:31,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:31,433 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 102 flow [2025-03-09 06:22:31,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2025-03-09 06:22:31,434 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-03-09 06:22:31,434 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 102 flow [2025-03-09 06:22:31,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-09 06:22:31,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:31,434 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-09 06:22:31,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:22:31,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-09 06:22:31,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:31,435 INFO L85 PathProgramCache]: Analyzing trace with hash -262330285, now seen corresponding path program 1 times [2025-03-09 06:22:31,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:31,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233056498] [2025-03-09 06:22:31,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:31,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:31,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:22:31,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:22:31,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:31,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:31,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233056498] [2025-03-09 06:22:31,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233056498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480018404] [2025-03-09 06:22:31,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:31,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:31,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:31,558 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-09 06:22:31,560 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-09 06:22:31,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:22:31,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:22:31,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:31,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:31,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:22:31,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:31,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:22:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:31,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480018404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:22:31,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:22:31,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-09 06:22:31,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245788233] [2025-03-09 06:22:31,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:22:31,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 06:22:31,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:31,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 06:22:31,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:22:31,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-09 06:22:31,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 102 flow. Second operand has 15 states, 15 states have (on average 12.333333333333334) internal successors, (185), 15 states have internal predecessors, (185), 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-09 06:22:31,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:31,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-09 06:22:31,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:31,822 INFO L124 PetriNetUnfolderBase]: 24/98 cut-off events. [2025-03-09 06:22:31,822 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-09 06:22:31,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 98 events. 24/98 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 20 based on Foata normal form. 3/93 useless extension candidates. Maximal degree in co-relation 146. Up to 60 conditions per place. [2025-03-09 06:22:31,823 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 16 selfloop transitions, 13 changer transitions 0/39 dead transitions. [2025-03-09 06:22:31,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 196 flow [2025-03-09 06:22:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:22:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 06:22:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 175 transitions. [2025-03-09 06:22:31,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40792540792540793 [2025-03-09 06:22:31,824 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 102 flow. Second operand 13 states and 175 transitions. [2025-03-09 06:22:31,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 196 flow [2025-03-09 06:22:31,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:31,826 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 175 flow [2025-03-09 06:22:31,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=175, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-03-09 06:22:31,826 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2025-03-09 06:22:31,826 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 175 flow [2025-03-09 06:22:31,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.333333333333334) internal successors, (185), 15 states have internal predecessors, (185), 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-09 06:22:31,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:31,827 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1] [2025-03-09 06:22:31,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:22:32,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:32,028 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-09 06:22:32,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash 733158181, now seen corresponding path program 2 times [2025-03-09 06:22:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:32,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030778786] [2025-03-09 06:22:32,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:22:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:32,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-09 06:22:32,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 06:22:32,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:22:32,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:32,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:22:32,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 06:22:32,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 06:22:32,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:32,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:32,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:22:32,094 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:22:32,095 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-09 06:22:32,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-03-09 06:22:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-03-09 06:22:32,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-03-09 06:22:32,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-03-09 06:22:32,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-03-09 06:22:32,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-03-09 06:22:32,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-03-09 06:22:32,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-03-09 06:22:32,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-03-09 06:22:32,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-03-09 06:22:32,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:22:32,100 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-09 06:22:32,102 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:22:32,103 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 06:22:32,121 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:22:32,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 120 flow [2025-03-09 06:22:32,129 INFO L124 PetriNetUnfolderBase]: 5/60 cut-off events. [2025-03-09 06:22:32,130 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:22:32,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 60 events. 5/60 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 123 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2025-03-09 06:22:32,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 55 transitions, 120 flow [2025-03-09 06:22:32,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 55 transitions, 120 flow [2025-03-09 06:22:32,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:22:32,134 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;@16345e55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:22:32,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-09 06:22:32,136 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:22:32,136 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 06:22:32,136 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:32,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:32,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:22:32,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-09 06:22:32,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash 298037, now seen corresponding path program 1 times [2025-03-09 06:22:32,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:32,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521184701] [2025-03-09 06:22:32,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:32,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:32,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:22:32,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:22:32,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:32,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:32,168 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-09 06:22:32,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:32,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521184701] [2025-03-09 06:22:32,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521184701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:32,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:32,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:32,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688903261] [2025-03-09 06:22:32,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:32,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:22:32,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:32,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:22:32,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:22:32,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-09 06:22:32,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-09 06:22:32,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:32,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-09 06:22:32,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:32,318 INFO L124 PetriNetUnfolderBase]: 640/1344 cut-off events. [2025-03-09 06:22:32,318 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-09 06:22:32,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2427 conditions, 1344 events. 640/1344 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7607 event pairs, 570 based on Foata normal form. 70/1297 useless extension candidates. Maximal degree in co-relation 1594. Up to 1043 conditions per place. [2025-03-09 06:22:32,326 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 31 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-03-09 06:22:32,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 186 flow [2025-03-09 06:22:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:22:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:22:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-09 06:22:32,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-09 06:22:32,328 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 120 flow. Second operand 4 states and 120 transitions. [2025-03-09 06:22:32,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 186 flow [2025-03-09 06:22:32,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:22:32,329 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 138 flow [2025-03-09 06:22:32,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-03-09 06:22:32,330 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2025-03-09 06:22:32,330 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 138 flow [2025-03-09 06:22:32,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-09 06:22:32,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:32,331 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 06:22:32,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:22:32,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-09 06:22:32,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash 289133740, now seen corresponding path program 1 times [2025-03-09 06:22:32,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:32,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975429675] [2025-03-09 06:22:32,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:32,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:32,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:32,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:32,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:32,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:32,382 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-09 06:22:32,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:32,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975429675] [2025-03-09 06:22:32,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975429675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:32,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993397666] [2025-03-09 06:22:32,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:32,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:32,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:32,385 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-09 06:22:32,387 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-09 06:22:32,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:32,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:32,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:32,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:32,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:22:32,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:32,455 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-09 06:22:32,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:22:32,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993397666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:32,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:22:32,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:22:32,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989458817] [2025-03-09 06:22:32,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:32,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:22:32,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:32,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:22:32,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:22:32,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-09 06:22:32,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-09 06:22:32,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:32,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-09 06:22:32,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:32,614 INFO L124 PetriNetUnfolderBase]: 640/1343 cut-off events. [2025-03-09 06:22:32,614 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-09 06:22:32,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2437 conditions, 1343 events. 640/1343 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7597 event pairs, 570 based on Foata normal form. 1/1227 useless extension candidates. Maximal degree in co-relation 2418. Up to 1038 conditions per place. [2025-03-09 06:22:32,623 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 27 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2025-03-09 06:22:32,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 200 flow [2025-03-09 06:22:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:22:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:22:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2025-03-09 06:22:32,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-09 06:22:32,624 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 138 flow. Second operand 6 states and 154 transitions. [2025-03-09 06:22:32,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 200 flow [2025-03-09 06:22:32,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:22:32,627 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 144 flow [2025-03-09 06:22:32,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2025-03-09 06:22:32,628 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2025-03-09 06:22:32,628 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 144 flow [2025-03-09 06:22:32,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-09 06:22:32,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:32,629 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-09 06:22:32,635 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-09 06:22:32,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:32,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-09 06:22:32,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:32,830 INFO L85 PathProgramCache]: Analyzing trace with hash 373211596, now seen corresponding path program 1 times [2025-03-09 06:22:32,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:32,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997701566] [2025-03-09 06:22:32,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:32,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:32,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:22:32,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:22:32,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:32,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:22:32,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:32,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997701566] [2025-03-09 06:22:32,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997701566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:32,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:32,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:32,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912566856] [2025-03-09 06:22:32,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:32,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:32,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:32,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:32,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-09 06:22:32,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-09 06:22:32,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:32,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-09 06:22:32,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:32,988 INFO L124 PetriNetUnfolderBase]: 640/1342 cut-off events. [2025-03-09 06:22:32,989 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-09 06:22:32,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1342 events. 640/1342 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7584 event pairs, 570 based on Foata normal form. 1/1227 useless extension candidates. Maximal degree in co-relation 2414. Up to 1041 conditions per place. [2025-03-09 06:22:32,995 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 28 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2025-03-09 06:22:32,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 204 flow [2025-03-09 06:22:32,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:32,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-09 06:22:32,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2025-03-09 06:22:32,997 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 144 flow. Second operand 3 states and 91 transitions. [2025-03-09 06:22:32,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 204 flow [2025-03-09 06:22:32,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 182 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 06:22:32,998 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 126 flow [2025-03-09 06:22:32,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2025-03-09 06:22:32,999 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2025-03-09 06:22:32,999 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 126 flow [2025-03-09 06:22:32,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-09 06:22:32,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:32,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:32,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:22:32,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-09 06:22:33,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:33,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2120403374, now seen corresponding path program 1 times [2025-03-09 06:22:33,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:33,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242464814] [2025-03-09 06:22:33,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:33,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:33,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:33,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:33,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:33,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:33,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:33,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242464814] [2025-03-09 06:22:33,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242464814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:33,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604179324] [2025-03-09 06:22:33,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:33,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:33,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:33,045 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-09 06:22:33,047 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-09 06:22:33,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:33,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:33,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:33,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:33,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:22:33,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:33,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:22:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:33,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604179324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:22:33,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:22:33,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 06:22:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311485434] [2025-03-09 06:22:33,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:22:33,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:22:33,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:33,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:22:33,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:22:33,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-09 06:22:33,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 126 flow. Second operand has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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-09 06:22:33,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:33,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-09 06:22:33,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:33,344 INFO L124 PetriNetUnfolderBase]: 640/1346 cut-off events. [2025-03-09 06:22:33,345 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-09 06:22:33,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 1346 events. 640/1346 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7581 event pairs, 570 based on Foata normal form. 2/1233 useless extension candidates. Maximal degree in co-relation 2407. Up to 1039 conditions per place. [2025-03-09 06:22:33,352 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 28 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2025-03-09 06:22:33,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 211 flow [2025-03-09 06:22:33,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:22:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:22:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-03-09 06:22:33,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4597402597402597 [2025-03-09 06:22:33,354 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 126 flow. Second operand 7 states and 177 transitions. [2025-03-09 06:22:33,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 211 flow [2025-03-09 06:22:33,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:33,356 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 152 flow [2025-03-09 06:22:33,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2025-03-09 06:22:33,357 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2025-03-09 06:22:33,357 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 152 flow [2025-03-09 06:22:33,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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-09 06:22:33,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:33,357 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:33,364 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-09 06:22:33,557 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,SelfDestructingSolverStorable10 [2025-03-09 06:22:33,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-09 06:22:33,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:33,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2011256562, now seen corresponding path program 2 times [2025-03-09 06:22:33,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:33,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44101214] [2025-03-09 06:22:33,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:22:33,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:33,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 06:22:33,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-09 06:22:33,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:22:33,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 06:22:33,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:33,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44101214] [2025-03-09 06:22:33,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44101214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:33,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:33,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:33,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364917810] [2025-03-09 06:22:33,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:33,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:33,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:33,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:33,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:33,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-09 06:22:33,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-09 06:22:33,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:33,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-09 06:22:33,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:33,764 INFO L124 PetriNetUnfolderBase]: 698/1432 cut-off events. [2025-03-09 06:22:33,764 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-09 06:22:33,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 1432 events. 698/1432 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8031 event pairs, 291 based on Foata normal form. 36/1390 useless extension candidates. Maximal degree in co-relation 2592. Up to 976 conditions per place. [2025-03-09 06:22:33,769 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 48 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-09 06:22:33,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 283 flow [2025-03-09 06:22:33,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-09 06:22:33,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2025-03-09 06:22:33,770 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 152 flow. Second operand 3 states and 106 transitions. [2025-03-09 06:22:33,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 283 flow [2025-03-09 06:22:33,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:33,771 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 150 flow [2025-03-09 06:22:33,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-03-09 06:22:33,772 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2025-03-09 06:22:33,772 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 150 flow [2025-03-09 06:22:33,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-09 06:22:33,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:33,772 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:33,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:22:33,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-09 06:22:33,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:33,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2075555736, now seen corresponding path program 1 times [2025-03-09 06:22:33,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:33,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106557531] [2025-03-09 06:22:33,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:33,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:33,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:22:33,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:22:33,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:33,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 06:22:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106557531] [2025-03-09 06:22:33,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106557531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:33,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:33,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:33,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202381381] [2025-03-09 06:22:33,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:33,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:33,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:33,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:33,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:33,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-09 06:22:33,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-09 06:22:33,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:33,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-09 06:22:33,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:33,933 INFO L124 PetriNetUnfolderBase]: 640/1326 cut-off events. [2025-03-09 06:22:33,934 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-03-09 06:22:33,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 1326 events. 640/1326 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7259 event pairs, 264 based on Foata normal form. 36/1290 useless extension candidates. Maximal degree in co-relation 2461. Up to 882 conditions per place. [2025-03-09 06:22:33,940 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 47 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2025-03-09 06:22:33,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 279 flow [2025-03-09 06:22:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-09 06:22:33,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-09 06:22:33,942 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 150 flow. Second operand 3 states and 105 transitions. [2025-03-09 06:22:33,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 67 transitions, 279 flow [2025-03-09 06:22:33,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 67 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:33,944 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 148 flow [2025-03-09 06:22:33,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2025-03-09 06:22:33,944 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2025-03-09 06:22:33,945 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 148 flow [2025-03-09 06:22:33,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-09 06:22:33,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:33,945 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:33,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:22:33,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-09 06:22:33,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1790773801, now seen corresponding path program 1 times [2025-03-09 06:22:33,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:33,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899654145] [2025-03-09 06:22:33,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:33,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:22:33,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:22:33,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:33,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:33,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 06:22:33,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:33,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899654145] [2025-03-09 06:22:33,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899654145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:33,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:33,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:33,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26833367] [2025-03-09 06:22:33,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:33,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:33,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:33,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:33,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:34,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-09 06:22:34,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 06:22:34,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:34,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-09 06:22:34,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:34,106 INFO L124 PetriNetUnfolderBase]: 695/1410 cut-off events. [2025-03-09 06:22:34,107 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-09 06:22:34,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 1410 events. 695/1410 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7814 event pairs, 102 based on Foata normal form. 33/1396 useless extension candidates. Maximal degree in co-relation 2639. Up to 913 conditions per place. [2025-03-09 06:22:34,113 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 47 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-03-09 06:22:34,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 274 flow [2025-03-09 06:22:34,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:34,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-09 06:22:34,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-09 06:22:34,115 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 148 flow. Second operand 3 states and 105 transitions. [2025-03-09 06:22:34,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 274 flow [2025-03-09 06:22:34,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 65 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:34,116 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 146 flow [2025-03-09 06:22:34,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2025-03-09 06:22:34,117 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places. [2025-03-09 06:22:34,117 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 146 flow [2025-03-09 06:22:34,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 06:22:34,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:34,117 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-09 06:22:34,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 06:22:34,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-09 06:22:34,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash 320559694, now seen corresponding path program 1 times [2025-03-09 06:22:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:34,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555719154] [2025-03-09 06:22:34,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:34,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:22:34,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:22:34,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:34,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:34,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:34,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555719154] [2025-03-09 06:22:34,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555719154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:34,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598105137] [2025-03-09 06:22:34,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:34,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:34,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:34,193 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-09 06:22:34,194 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-09 06:22:34,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:22:34,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:22:34,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:34,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:34,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:22:34,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:34,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:22:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598105137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:22:34,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:22:34,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-09 06:22:34,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539119678] [2025-03-09 06:22:34,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:22:34,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 06:22:34,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:34,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 06:22:34,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:22:34,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-09 06:22:34,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 146 flow. Second operand has 15 states, 15 states have (on average 21.4) internal successors, (321), 15 states have internal predecessors, (321), 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-09 06:22:34,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:34,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-09 06:22:34,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:34,550 INFO L124 PetriNetUnfolderBase]: 640/1331 cut-off events. [2025-03-09 06:22:34,550 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-09 06:22:34,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2517 conditions, 1331 events. 640/1331 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7435 event pairs, 570 based on Foata normal form. 3/1239 useless extension candidates. Maximal degree in co-relation 2451. Up to 1039 conditions per place. [2025-03-09 06:22:34,556 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 28 selfloop transitions, 13 changer transitions 0/58 dead transitions. [2025-03-09 06:22:34,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 58 transitions, 264 flow [2025-03-09 06:22:34,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:22:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 06:22:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 304 transitions. [2025-03-09 06:22:34,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4251748251748252 [2025-03-09 06:22:34,558 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 146 flow. Second operand 13 states and 304 transitions. [2025-03-09 06:22:34,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 58 transitions, 264 flow [2025-03-09 06:22:34,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 58 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:34,560 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 219 flow [2025-03-09 06:22:34,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=219, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2025-03-09 06:22:34,561 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2025-03-09 06:22:34,561 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 219 flow [2025-03-09 06:22:34,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 21.4) internal successors, (321), 15 states have internal predecessors, (321), 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-09 06:22:34,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:34,561 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-03-09 06:22:34,567 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-09 06:22:34,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 06:22:34,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-09 06:22:34,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:34,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1472641061, now seen corresponding path program 2 times [2025-03-09 06:22:34,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:34,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975801801] [2025-03-09 06:22:34,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:22:34,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:34,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-09 06:22:34,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:22:34,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:22:34,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:34,783 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:22:34,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 06:22:34,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:22:34,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:34,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:34,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:22:34,808 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:22:34,808 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-09 06:22:34,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-03-09 06:22:34,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-03-09 06:22:34,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-03-09 06:22:34,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-03-09 06:22:34,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-03-09 06:22:34,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-03-09 06:22:34,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-03-09 06:22:34,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-03-09 06:22:34,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-03-09 06:22:34,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-03-09 06:22:34,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-03-09 06:22:34,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-03-09 06:22:34,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-03-09 06:22:34,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-03-09 06:22:34,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 06:22:34,809 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:22:34,809 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:22:34,809 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 06:22:34,835 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:22:34,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 77 transitions, 172 flow [2025-03-09 06:22:34,846 INFO L124 PetriNetUnfolderBase]: 7/85 cut-off events. [2025-03-09 06:22:34,846 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 06:22:34,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 221 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 66. Up to 4 conditions per place. [2025-03-09 06:22:34,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 77 transitions, 172 flow [2025-03-09 06:22:34,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 77 transitions, 172 flow [2025-03-09 06:22:34,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:22:34,848 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;@16345e55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:22:34,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-09 06:22:34,849 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:22:34,849 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 06:22:34,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:34,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:34,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:22:34,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:22:34,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:34,849 INFO L85 PathProgramCache]: Analyzing trace with hash 374498, now seen corresponding path program 1 times [2025-03-09 06:22:34,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:34,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079976828] [2025-03-09 06:22:34,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:34,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:34,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:22:34,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:22:34,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:34,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:34,876 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-09 06:22:34,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:34,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079976828] [2025-03-09 06:22:34,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079976828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:34,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:34,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:34,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177719337] [2025-03-09 06:22:34,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:34,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:22:34,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:34,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:22:34,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:22:34,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-09 06:22:34,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-09 06:22:34,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:34,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-09 06:22:34,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:35,898 INFO L124 PetriNetUnfolderBase]: 11409/19193 cut-off events. [2025-03-09 06:22:35,899 INFO L125 PetriNetUnfolderBase]: For 799/799 co-relation queries the response was YES. [2025-03-09 06:22:35,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35523 conditions, 19193 events. 11409/19193 cut-off events. For 799/799 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146673 event pairs, 10250 based on Foata normal form. 1159/19041 useless extension candidates. Maximal degree in co-relation 15025. Up to 15805 conditions per place. [2025-03-09 06:22:36,035 INFO L140 encePairwiseOnDemand]: 67/77 looper letters, 43 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-03-09 06:22:36,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 75 transitions, 260 flow [2025-03-09 06:22:36,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:22:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:22:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2025-03-09 06:22:36,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5487012987012987 [2025-03-09 06:22:36,036 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 172 flow. Second operand 4 states and 169 transitions. [2025-03-09 06:22:36,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 75 transitions, 260 flow [2025-03-09 06:22:36,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 258 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-09 06:22:36,038 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 186 flow [2025-03-09 06:22:36,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-03-09 06:22:36,038 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-03-09 06:22:36,038 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 186 flow [2025-03-09 06:22:36,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-09 06:22:36,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:36,039 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 06:22:36,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:22:36,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:22:36,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:36,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1727907444, now seen corresponding path program 1 times [2025-03-09 06:22:36,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:36,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103390688] [2025-03-09 06:22:36,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:36,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:36,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:36,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:36,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:36,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:36,071 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-09 06:22:36,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103390688] [2025-03-09 06:22:36,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103390688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317011934] [2025-03-09 06:22:36,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:36,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:36,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:36,074 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-09 06:22:36,075 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-09 06:22:36,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:36,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:36,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:36,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:36,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:22:36,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:36,141 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-09 06:22:36,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:22:36,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317011934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:36,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:22:36,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:22:36,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851106482] [2025-03-09 06:22:36,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:36,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:22:36,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:36,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:22:36,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:22:36,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-09 06:22:36,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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-09 06:22:36,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:36,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-09 06:22:36,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:37,169 INFO L124 PetriNetUnfolderBase]: 11409/19192 cut-off events. [2025-03-09 06:22:37,169 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2025-03-09 06:22:37,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35412 conditions, 19192 events. 11409/19192 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146644 event pairs, 10250 based on Foata normal form. 1/17882 useless extension candidates. Maximal degree in co-relation 35392. Up to 15800 conditions per place. [2025-03-09 06:22:37,285 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 39 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2025-03-09 06:22:37,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 74 transitions, 272 flow [2025-03-09 06:22:37,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:22:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:22:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2025-03-09 06:22:37,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-09 06:22:37,287 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 186 flow. Second operand 6 states and 220 transitions. [2025-03-09 06:22:37,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 74 transitions, 272 flow [2025-03-09 06:22:37,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 74 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:22:37,289 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 192 flow [2025-03-09 06:22:37,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2025-03-09 06:22:37,290 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-09 06:22:37,290 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 192 flow [2025-03-09 06:22:37,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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-09 06:22:37,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:37,290 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-09 06:22:37,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 06:22:37,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:37,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:22:37,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash -2025522887, now seen corresponding path program 1 times [2025-03-09 06:22:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:37,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816246562] [2025-03-09 06:22:37,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:37,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:37,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:22:37,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:22:37,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:37,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:22:37,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:37,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816246562] [2025-03-09 06:22:37,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816246562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:37,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:37,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:37,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703249693] [2025-03-09 06:22:37,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:37,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:37,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:37,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:37,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:37,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-09 06:22:37,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-09 06:22:37,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:37,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-09 06:22:37,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:38,460 INFO L124 PetriNetUnfolderBase]: 11409/19191 cut-off events. [2025-03-09 06:22:38,460 INFO L125 PetriNetUnfolderBase]: For 447/447 co-relation queries the response was YES. [2025-03-09 06:22:38,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35414 conditions, 19191 events. 11409/19191 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146683 event pairs, 10250 based on Foata normal form. 1/17882 useless extension candidates. Maximal degree in co-relation 35388. Up to 15803 conditions per place. [2025-03-09 06:22:38,550 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 40 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2025-03-09 06:22:38,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 73 transitions, 276 flow [2025-03-09 06:22:38,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-03-09 06:22:38,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5627705627705628 [2025-03-09 06:22:38,551 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 192 flow. Second operand 3 states and 130 transitions. [2025-03-09 06:22:38,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 73 transitions, 276 flow [2025-03-09 06:22:38,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 73 transitions, 254 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 06:22:38,553 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 174 flow [2025-03-09 06:22:38,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2025-03-09 06:22:38,554 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 2 predicate places. [2025-03-09 06:22:38,554 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 174 flow [2025-03-09 06:22:38,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-09 06:22:38,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:38,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:38,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 06:22:38,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:22:38,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:38,555 INFO L85 PathProgramCache]: Analyzing trace with hash -906780940, now seen corresponding path program 1 times [2025-03-09 06:22:38,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:38,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921104230] [2025-03-09 06:22:38,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:38,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:38,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:38,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:38,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:38,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:38,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:38,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921104230] [2025-03-09 06:22:38,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921104230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:38,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290883297] [2025-03-09 06:22:38,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:38,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:38,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:38,588 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-09 06:22:38,590 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-09 06:22:38,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:38,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:38,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:38,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:38,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:22:38,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:38,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:22:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:38,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290883297] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:22:38,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:22:38,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 06:22:38,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032837071] [2025-03-09 06:22:38,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:22:38,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:22:38,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:38,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:22:38,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:22:38,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-09 06:22:38,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 174 flow. Second operand has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 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-09 06:22:38,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:38,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-09 06:22:38,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:39,766 INFO L124 PetriNetUnfolderBase]: 11409/19195 cut-off events. [2025-03-09 06:22:39,767 INFO L125 PetriNetUnfolderBase]: For 449/449 co-relation queries the response was YES. [2025-03-09 06:22:39,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35417 conditions, 19195 events. 11409/19195 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146528 event pairs, 10250 based on Foata normal form. 2/17888 useless extension candidates. Maximal degree in co-relation 35381. Up to 15801 conditions per place. [2025-03-09 06:22:39,854 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 40 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2025-03-09 06:22:39,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 76 transitions, 283 flow [2025-03-09 06:22:39,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:22:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:22:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 252 transitions. [2025-03-09 06:22:39,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2025-03-09 06:22:39,856 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 174 flow. Second operand 7 states and 252 transitions. [2025-03-09 06:22:39,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 76 transitions, 283 flow [2025-03-09 06:22:39,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:39,858 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 200 flow [2025-03-09 06:22:39,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2025-03-09 06:22:39,858 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2025-03-09 06:22:39,858 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 200 flow [2025-03-09 06:22:39,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 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-09 06:22:39,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:39,858 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:39,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 06:22:40,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:40,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:22:40,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash 128243380, now seen corresponding path program 2 times [2025-03-09 06:22:40,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:40,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733062121] [2025-03-09 06:22:40,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:22:40,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:40,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 06:22:40,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-09 06:22:40,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:22:40,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 06:22:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733062121] [2025-03-09 06:22:40,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733062121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:40,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:40,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:40,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465117718] [2025-03-09 06:22:40,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:40,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:40,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:40,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:40,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:40,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-09 06:22:40,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 06:22:40,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:40,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-09 06:22:40,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:41,434 INFO L124 PetriNetUnfolderBase]: 12446/20635 cut-off events. [2025-03-09 06:22:41,434 INFO L125 PetriNetUnfolderBase]: For 463/463 co-relation queries the response was YES. [2025-03-09 06:22:41,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38336 conditions, 20635 events. 12446/20635 cut-off events. For 463/463 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 159204 event pairs, 1538 based on Foata normal form. 399/20377 useless extension candidates. Maximal degree in co-relation 38295. Up to 14759 conditions per place. [2025-03-09 06:22:41,498 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 72 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-09 06:22:41,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 101 transitions, 408 flow [2025-03-09 06:22:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-03-09 06:22:41,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6796536796536796 [2025-03-09 06:22:41,500 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 200 flow. Second operand 3 states and 157 transitions. [2025-03-09 06:22:41,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 101 transitions, 408 flow [2025-03-09 06:22:41,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 101 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:41,501 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 198 flow [2025-03-09 06:22:41,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2025-03-09 06:22:41,502 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-09 06:22:41,502 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 198 flow [2025-03-09 06:22:41,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 06:22:41,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:41,502 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:41,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 06:22:41,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:22:41,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:41,502 INFO L85 PathProgramCache]: Analyzing trace with hash -319422157, now seen corresponding path program 1 times [2025-03-09 06:22:41,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:41,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983975061] [2025-03-09 06:22:41,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:41,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:41,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:22:41,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:22:41,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:41,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 06:22:41,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:41,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983975061] [2025-03-09 06:22:41,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983975061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:41,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:41,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:41,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569099773] [2025-03-09 06:22:41,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:41,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:41,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:41,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:41,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:41,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-09 06:22:41,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 06:22:41,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:41,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-09 06:22:41,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:42,444 INFO L124 PetriNetUnfolderBase]: 11409/19199 cut-off events. [2025-03-09 06:22:42,444 INFO L125 PetriNetUnfolderBase]: For 1221/1221 co-relation queries the response was YES. [2025-03-09 06:22:42,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36225 conditions, 19199 events. 11409/19199 cut-off events. For 1221/1221 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 148682 event pairs, 1538 based on Foata normal form. 399/18956 useless extension candidates. Maximal degree in co-relation 36185. Up to 13323 conditions per place. [2025-03-09 06:22:42,515 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 71 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-03-09 06:22:42,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 100 transitions, 404 flow [2025-03-09 06:22:42,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-03-09 06:22:42,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6753246753246753 [2025-03-09 06:22:42,516 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 198 flow. Second operand 3 states and 156 transitions. [2025-03-09 06:22:42,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 100 transitions, 404 flow [2025-03-09 06:22:42,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 100 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:42,519 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 196 flow [2025-03-09 06:22:42,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2025-03-09 06:22:42,519 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-03-09 06:22:42,519 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 196 flow [2025-03-09 06:22:42,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 06:22:42,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:42,519 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:42,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 06:22:42,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:22:42,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:42,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2068527721, now seen corresponding path program 1 times [2025-03-09 06:22:42,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:42,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651446992] [2025-03-09 06:22:42,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:42,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:42,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:22:42,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:22:42,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:42,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:42,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:42,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651446992] [2025-03-09 06:22:42,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651446992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:42,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198197753] [2025-03-09 06:22:42,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:42,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:42,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:42,588 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:22:42,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 06:22:42,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:22:42,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:22:42,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:42,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:42,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:22:42,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:42,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:22:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:42,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198197753] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:22:42,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:22:42,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-09 06:22:42,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596255577] [2025-03-09 06:22:42,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:22:42,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 06:22:42,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:42,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 06:22:42,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:22:42,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-09 06:22:42,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 196 flow. Second operand has 15 states, 15 states have (on average 30.466666666666665) internal successors, (457), 15 states have internal predecessors, (457), 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-09 06:22:42,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:42,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-09 06:22:42,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:43,725 INFO L124 PetriNetUnfolderBase]: 11409/19208 cut-off events. [2025-03-09 06:22:43,725 INFO L125 PetriNetUnfolderBase]: For 1264/1264 co-relation queries the response was YES. [2025-03-09 06:22:43,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36252 conditions, 19208 events. 11409/19208 cut-off events. For 1264/1264 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146526 event pairs, 10250 based on Foata normal form. 3/17902 useless extension candidates. Maximal degree in co-relation 36185. Up to 15801 conditions per place. [2025-03-09 06:22:43,817 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 40 selfloop transitions, 13 changer transitions 0/80 dead transitions. [2025-03-09 06:22:43,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 80 transitions, 338 flow [2025-03-09 06:22:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:22:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 06:22:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 433 transitions. [2025-03-09 06:22:43,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4325674325674326 [2025-03-09 06:22:43,819 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 196 flow. Second operand 13 states and 433 transitions. [2025-03-09 06:22:43,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 80 transitions, 338 flow [2025-03-09 06:22:43,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 80 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:43,821 INFO L231 Difference]: Finished difference. Result has 96 places, 80 transitions, 269 flow [2025-03-09 06:22:43,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=269, PETRI_PLACES=96, PETRI_TRANSITIONS=80} [2025-03-09 06:22:43,821 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 19 predicate places. [2025-03-09 06:22:43,821 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 80 transitions, 269 flow [2025-03-09 06:22:43,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 30.466666666666665) internal successors, (457), 15 states have internal predecessors, (457), 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-09 06:22:43,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:43,821 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:43,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 06:22:44,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:44,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:22:44,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:44,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1989996909, now seen corresponding path program 2 times [2025-03-09 06:22:44,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:44,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877674816] [2025-03-09 06:22:44,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:22:44,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:44,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 06:22:44,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 27 statements. [2025-03-09 06:22:44,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:22:44,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-09 06:22:44,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:44,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877674816] [2025-03-09 06:22:44,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877674816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:44,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:44,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:44,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875170555] [2025-03-09 06:22:44,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:44,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:44,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:44,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:44,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:44,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-09 06:22:44,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 80 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-09 06:22:44,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:44,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-09 06:22:44,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:45,090 INFO L124 PetriNetUnfolderBase]: 12443/20448 cut-off events. [2025-03-09 06:22:45,090 INFO L125 PetriNetUnfolderBase]: For 498/498 co-relation queries the response was YES. [2025-03-09 06:22:45,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38180 conditions, 20448 events. 12443/20448 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 151637 event pairs, 3941 based on Foata normal form. 396/19981 useless extension candidates. Maximal degree in co-relation 38093. Up to 14696 conditions per place. [2025-03-09 06:22:45,222 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 77 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2025-03-09 06:22:45,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 104 transitions, 480 flow [2025-03-09 06:22:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-03-09 06:22:45,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6753246753246753 [2025-03-09 06:22:45,223 INFO L175 Difference]: Start difference. First operand has 96 places, 80 transitions, 269 flow. Second operand 3 states and 156 transitions. [2025-03-09 06:22:45,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 104 transitions, 480 flow [2025-03-09 06:22:45,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 104 transitions, 470 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 06:22:45,225 INFO L231 Difference]: Finished difference. Result has 93 places, 79 transitions, 261 flow [2025-03-09 06:22:45,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=93, PETRI_TRANSITIONS=79} [2025-03-09 06:22:45,225 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 16 predicate places. [2025-03-09 06:22:45,225 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 79 transitions, 261 flow [2025-03-09 06:22:45,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-09 06:22:45,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:45,225 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:45,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 06:22:45,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:22:45,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:45,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1560362415, now seen corresponding path program 1 times [2025-03-09 06:22:45,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:45,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692981509] [2025-03-09 06:22:45,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:45,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:45,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 06:22:45,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:22:45,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:45,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-09 06:22:45,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:45,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692981509] [2025-03-09 06:22:45,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692981509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:45,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:45,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:45,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880357351] [2025-03-09 06:22:45,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:45,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:45,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:45,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:45,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-09 06:22:45,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 79 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-09 06:22:45,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:45,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-09 06:22:45,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:46,516 INFO L124 PetriNetUnfolderBase]: 11409/18886 cut-off events. [2025-03-09 06:22:46,516 INFO L125 PetriNetUnfolderBase]: For 1246/1246 co-relation queries the response was YES. [2025-03-09 06:22:46,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35943 conditions, 18886 events. 11409/18886 cut-off events. For 1246/1246 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 138908 event pairs, 3644 based on Foata normal form. 396/18470 useless extension candidates. Maximal degree in co-relation 35860. Up to 13266 conditions per place. [2025-03-09 06:22:46,642 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 76 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2025-03-09 06:22:46,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 103 transitions, 470 flow [2025-03-09 06:22:46,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-09 06:22:46,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.670995670995671 [2025-03-09 06:22:46,643 INFO L175 Difference]: Start difference. First operand has 93 places, 79 transitions, 261 flow. Second operand 3 states and 155 transitions. [2025-03-09 06:22:46,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 103 transitions, 470 flow [2025-03-09 06:22:46,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 103 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:46,646 INFO L231 Difference]: Finished difference. Result has 92 places, 78 transitions, 259 flow [2025-03-09 06:22:46,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=92, PETRI_TRANSITIONS=78} [2025-03-09 06:22:46,646 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 15 predicate places. [2025-03-09 06:22:46,646 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 78 transitions, 259 flow [2025-03-09 06:22:46,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-09 06:22:46,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:46,647 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:46,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 06:22:46,647 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:22:46,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:46,647 INFO L85 PathProgramCache]: Analyzing trace with hash 498141535, now seen corresponding path program 1 times [2025-03-09 06:22:46,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:46,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727102547] [2025-03-09 06:22:46,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:46,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:46,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:22:46,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:22:46,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:46,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-09 06:22:46,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:46,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727102547] [2025-03-09 06:22:46,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727102547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:46,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:46,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:46,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657380866] [2025-03-09 06:22:46,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:46,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:46,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:46,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:46,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:46,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-09 06:22:46,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 78 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:46,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:46,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-09 06:22:46,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:47,671 INFO L124 PetriNetUnfolderBase]: 12377/20383 cut-off events. [2025-03-09 06:22:47,671 INFO L125 PetriNetUnfolderBase]: For 1342/1342 co-relation queries the response was YES. [2025-03-09 06:22:47,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38837 conditions, 20383 events. 12377/20383 cut-off events. For 1342/1342 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 152927 event pairs, 2132 based on Foata normal form. 363/20142 useless extension candidates. Maximal degree in co-relation 38754. Up to 13673 conditions per place. [2025-03-09 06:22:47,813 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 76 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-09 06:22:47,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 101 transitions, 465 flow [2025-03-09 06:22:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-09 06:22:47,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.670995670995671 [2025-03-09 06:22:47,814 INFO L175 Difference]: Start difference. First operand has 92 places, 78 transitions, 259 flow. Second operand 3 states and 155 transitions. [2025-03-09 06:22:47,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 101 transitions, 465 flow [2025-03-09 06:22:47,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 101 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:47,818 INFO L231 Difference]: Finished difference. Result has 91 places, 77 transitions, 257 flow [2025-03-09 06:22:47,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=91, PETRI_TRANSITIONS=77} [2025-03-09 06:22:47,818 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 14 predicate places. [2025-03-09 06:22:47,818 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 77 transitions, 257 flow [2025-03-09 06:22:47,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:47,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:47,819 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:47,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 06:22:47,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-09 06:22:47,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:47,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1737508824, now seen corresponding path program 1 times [2025-03-09 06:22:47,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:47,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118434712] [2025-03-09 06:22:47,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:47,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:47,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:22:47,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:22:47,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:47,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:47,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:22:47,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:22:47,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:22:47,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:47,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:47,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:22:47,842 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:22:47,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-03-09 06:22:47,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-03-09 06:22:47,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-03-09 06:22:47,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-03-09 06:22:47,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 06:22:47,844 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:47,844 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:22:47,844 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-09 06:22:47,864 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:22:47,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 99 transitions, 226 flow [2025-03-09 06:22:47,870 INFO L124 PetriNetUnfolderBase]: 9/110 cut-off events. [2025-03-09 06:22:47,870 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 06:22:47,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 110 events. 9/110 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 331 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 93. Up to 5 conditions per place. [2025-03-09 06:22:47,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 99 transitions, 226 flow [2025-03-09 06:22:47,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 99 transitions, 226 flow [2025-03-09 06:22:47,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:22:47,872 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;@16345e55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:22:47,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-09 06:22:47,873 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:22:47,873 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 06:22:47,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:47,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:47,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:22:47,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-09 06:22:47,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash 472805, now seen corresponding path program 1 times [2025-03-09 06:22:47,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:47,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776154328] [2025-03-09 06:22:47,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:47,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:47,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:22:47,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:22:47,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:47,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:47,890 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-09 06:22:47,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:47,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776154328] [2025-03-09 06:22:47,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776154328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:47,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:47,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:47,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821361759] [2025-03-09 06:22:47,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:47,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:22:47,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:47,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:22:47,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:22:47,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 99 [2025-03-09 06:22:47,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 99 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-09 06:22:47,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:47,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 99 [2025-03-09 06:22:47,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:23:01,179 INFO L124 PetriNetUnfolderBase]: 173791/260043 cut-off events. [2025-03-09 06:23:01,179 INFO L125 PetriNetUnfolderBase]: For 14935/14935 co-relation queries the response was YES. [2025-03-09 06:23:01,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489334 conditions, 260043 events. 173791/260043 cut-off events. For 14935/14935 co-relation queries the response was YES. Maximal size of possible extension queue 8058. Compared 2290267 event pairs, 156660 based on Foata normal form. 17131/262292 useless extension candidates. Maximal degree in co-relation 75190. Up to 222110 conditions per place. [2025-03-09 06:23:02,759 INFO L140 encePairwiseOnDemand]: 88/99 looper letters, 55 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-03-09 06:23:02,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 336 flow [2025-03-09 06:23:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:23:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:23:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 218 transitions. [2025-03-09 06:23:02,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5505050505050505 [2025-03-09 06:23:02,760 INFO L175 Difference]: Start difference. First operand has 99 places, 99 transitions, 226 flow. Second operand 4 states and 218 transitions. [2025-03-09 06:23:02,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 336 flow [2025-03-09 06:23:02,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 96 transitions, 330 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-09 06:23:02,770 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 234 flow [2025-03-09 06:23:02,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2025-03-09 06:23:02,770 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 4 predicate places. [2025-03-09 06:23:02,770 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 234 flow [2025-03-09 06:23:02,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-09 06:23:02,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:23:02,770 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 06:23:02,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 06:23:02,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-09 06:23:02,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:23:02,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1200854700, now seen corresponding path program 1 times [2025-03-09 06:23:02,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:23:02,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420998699] [2025-03-09 06:23:02,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:23:02,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:23:02,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:23:02,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:23:02,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:23:02,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:23:02,800 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-09 06:23:02,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:23:02,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420998699] [2025-03-09 06:23:02,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420998699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:23:02,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246080076] [2025-03-09 06:23:02,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:23:02,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:23:02,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:23:02,803 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:23:02,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 06:23:02,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:23:02,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:23:02,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:23:02,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:23:02,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:23:02,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:23:02,880 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-09 06:23:02,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:23:02,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246080076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:23:02,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:23:02,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:23:02,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594507759] [2025-03-09 06:23:02,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:23:02,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:23:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:23:02,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:23:02,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:23:02,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 99 [2025-03-09 06:23:02,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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-09 06:23:02,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:23:02,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 99 [2025-03-09 06:23:02,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand