./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.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/11_fmaxsymopt-zero.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 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:22:28,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:22:28,130 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:28,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:22:28,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:22:28,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:22:28,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:22:28,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:22:28,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:22:28,153 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:22:28,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:22:28,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:22:28,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:22:28,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:22:28,154 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:22:28,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:22:28,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:22:28,155 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:22:28,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:22:28,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:22:28,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:22:28,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:22:28,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:22:28,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:22:28,155 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:22:28,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:22:28,156 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:22:28,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:22:28,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:22:28,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:22:28,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:22:28,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:22:28,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:22:28,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:22:28,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:22:28,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:22:28,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:22:28,157 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:22:28,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:22:28,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:22:28,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:22:28,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:22:28,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:22:28,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:22:28,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:22:28,157 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 -> 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb [2025-03-09 06:22:28,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:22:28,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:22:28,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:22:28,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:22:28,377 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:22:28,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-09 06:22:29,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2845ea78/f068ba04b01e4d10806844370502d4fa/FLAGc3cfa4213 [2025-03-09 06:22:29,766 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:22:29,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-09 06:22:29,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2845ea78/f068ba04b01e4d10806844370502d4fa/FLAGc3cfa4213 [2025-03-09 06:22:29,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2845ea78/f068ba04b01e4d10806844370502d4fa [2025-03-09 06:22:29,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:22:29,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:22:29,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:22:29,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:22:29,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:22:29,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24eea893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:29, skipping insertion in model container [2025-03-09 06:22:29,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:22:29" (1/1) ... [2025-03-09 06:22:29,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:22:30,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:22:30,087 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:22:30,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:22:30,155 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:22:30,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:30 WrapperNode [2025-03-09 06:22:30,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:22:30,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:22:30,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:22:30,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:22:30,161 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:30" (1/1) ... [2025-03-09 06:22:30,170 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:30" (1/1) ... [2025-03-09 06:22:30,185 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2025-03-09 06:22:30,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:22:30,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:22:30,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:22:30,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:22:30,193 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:30" (1/1) ... [2025-03-09 06:22:30,193 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:30" (1/1) ... [2025-03-09 06:22:30,195 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:30" (1/1) ... [2025-03-09 06:22:30,204 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-03-09 06:22:30,204 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:30" (1/1) ... [2025-03-09 06:22:30,205 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:30" (1/1) ... [2025-03-09 06:22:30,209 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:30" (1/1) ... [2025-03-09 06:22:30,210 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:30" (1/1) ... [2025-03-09 06:22:30,211 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:30" (1/1) ... [2025-03-09 06:22:30,211 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:30" (1/1) ... [2025-03-09 06:22:30,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:22:30,214 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:22:30,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:22:30,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:22:30,214 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:30" (1/1) ... [2025-03-09 06:22:30,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:22:30,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:30,249 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:30,259 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:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:22:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:22:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:22:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-09 06:22:30,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-09 06:22:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:22:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:22:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:22:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:22:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:22:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:22:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:22:30,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:22:30,281 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:30,372 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:22:30,377 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:22:30,558 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:22:30,559 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:22:30,680 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:22:30,680 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:22:30,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:22:30 BoogieIcfgContainer [2025-03-09 06:22:30,680 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:22:30,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:22:30,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:22:30,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:22:30,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:22:29" (1/3) ... [2025-03-09 06:22:30,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c3f2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:22:30, skipping insertion in model container [2025-03-09 06:22:30,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:22:30" (2/3) ... [2025-03-09 06:22:30,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c3f2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:22:30, skipping insertion in model container [2025-03-09 06:22:30,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:22:30" (3/3) ... [2025-03-09 06:22:30,690 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2025-03-09 06:22:30,701 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:22:30,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-zero.i that has 2 procedures, 24 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-09 06:22:30,703 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:22:30,741 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:22:30,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 28 transitions, 60 flow [2025-03-09 06:22:30,794 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-09 06:22:30,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:30,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 30 events. 4/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-09 06:22:30,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 28 transitions, 60 flow [2025-03-09 06:22:30,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 28 transitions, 60 flow [2025-03-09 06:22:30,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:22:30,819 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;@110ef022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:22:30,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-09 06:22:30,825 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:22:30,825 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-09 06:22:30,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:30,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:30,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:22:30,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:22:30,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:30,830 INFO L85 PathProgramCache]: Analyzing trace with hash 201013038, now seen corresponding path program 1 times [2025-03-09 06:22:30,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:30,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593200000] [2025-03-09 06:22:30,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:30,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:30,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:22:30,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:22:30,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:30,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:31,070 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:31,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:31,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593200000] [2025-03-09 06:22:31,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593200000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:31,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:31,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906178120] [2025-03-09 06:22:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:31,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:31,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:31,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:31,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:31,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2025-03-09 06:22:31,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 28 transitions, 60 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:31,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:31,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2025-03-09 06:22:31,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:31,185 INFO L124 PetriNetUnfolderBase]: 22/80 cut-off events. [2025-03-09 06:22:31,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:22:31,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 80 events. 22/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 231 event pairs, 2 based on Foata normal form. 6/80 useless extension candidates. Maximal degree in co-relation 120. Up to 38 conditions per place. [2025-03-09 06:22:31,187 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 13 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2025-03-09 06:22:31,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 86 flow [2025-03-09 06:22:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-03-09 06:22:31,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-03-09 06:22:31,200 INFO L175 Difference]: Start difference. First operand has 27 places, 28 transitions, 60 flow. Second operand 3 states and 53 transitions. [2025-03-09 06:22:31,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 86 flow [2025-03-09 06:22:31,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 86 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:22:31,206 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 56 flow [2025-03-09 06:22:31,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2025-03-09 06:22:31,211 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-03-09 06:22:31,211 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 56 flow [2025-03-09 06:22:31,212 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:31,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:31,212 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 06:22:31,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:22:31,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:22:31,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:31,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1936424488, now seen corresponding path program 1 times [2025-03-09 06:22:31,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:31,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962912834] [2025-03-09 06:22:31,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:31,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:31,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:31,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:31,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:31,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:31,234 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:22:31,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:31,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:31,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:31,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:31,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:22:31,267 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:22:31,269 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-09 06:22:31,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-03-09 06:22:31,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-03-09 06:22:31,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-03-09 06:22:31,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 9 remaining) [2025-03-09 06:22:31,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-03-09 06:22:31,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2025-03-09 06:22:31,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-03-09 06:22:31,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-03-09 06:22:31,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:22:31,271 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 06:22:31,273 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:22:31,273 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 06:22:31,307 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:22:31,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 51 transitions, 112 flow [2025-03-09 06:22:31,319 INFO L124 PetriNetUnfolderBase]: 8/56 cut-off events. [2025-03-09 06:22:31,319 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:22:31,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 56 events. 8/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 162 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-03-09 06:22:31,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 51 transitions, 112 flow [2025-03-09 06:22:31,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 51 transitions, 112 flow [2025-03-09 06:22:31,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:22:31,322 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;@110ef022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:22:31,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-09 06:22:31,326 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:22:31,326 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-09 06:22:31,326 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:22:31,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:31,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:22:31,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:22:31,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:31,327 INFO L85 PathProgramCache]: Analyzing trace with hash 249704439, now seen corresponding path program 1 times [2025-03-09 06:22:31,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:31,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29176124] [2025-03-09 06:22:31,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:31,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:31,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:22:31,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:22:31,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:31,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:31,404 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:31,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:31,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29176124] [2025-03-09 06:22:31,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29176124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:31,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:31,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:31,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093832170] [2025-03-09 06:22:31,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:31,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:31,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:31,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:31,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:31,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-03-09 06:22:31,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:31,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-03-09 06:22:31,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:31,641 INFO L124 PetriNetUnfolderBase]: 421/977 cut-off events. [2025-03-09 06:22:31,641 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-09 06:22:31,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 977 events. 421/977 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6007 event pairs, 54 based on Foata normal form. 108/1004 useless extension candidates. Maximal degree in co-relation 1348. Up to 517 conditions per place. [2025-03-09 06:22:31,652 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 31 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-03-09 06:22:31,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 193 flow [2025-03-09 06:22:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-03-09 06:22:31,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2025-03-09 06:22:31,655 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 112 flow. Second operand 3 states and 111 transitions. [2025-03-09 06:22:31,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 193 flow [2025-03-09 06:22:31,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:22:31,656 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 104 flow [2025-03-09 06:22:31,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-03-09 06:22:31,657 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2025-03-09 06:22:31,657 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 104 flow [2025-03-09 06:22:31,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:31,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:22:31,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:22:31,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:22:31,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash -849096735, now seen corresponding path program 1 times [2025-03-09 06:22:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:31,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211908299] [2025-03-09 06:22:31,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:31,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:31,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:31,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:31,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:31,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:31,740 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:31,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:31,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211908299] [2025-03-09 06:22:31,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211908299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:31,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:31,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068261606] [2025-03-09 06:22:31,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:31,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:31,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:31,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:31,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:31,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-03-09 06:22:31,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:31,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-03-09 06:22:31,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:31,888 INFO L124 PetriNetUnfolderBase]: 372/856 cut-off events. [2025-03-09 06:22:31,888 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-09 06:22:31,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1504 conditions, 856 events. 372/856 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4965 event pairs, 126 based on Foata normal form. 27/799 useless extension candidates. Maximal degree in co-relation 1292. Up to 447 conditions per place. [2025-03-09 06:22:31,895 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-03-09 06:22:31,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 193 flow [2025-03-09 06:22:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:31,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-09 06:22:31,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-09 06:22:31,897 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 104 flow. Second operand 3 states and 102 transitions. [2025-03-09 06:22:31,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 193 flow [2025-03-09 06:22:31,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:31,899 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 102 flow [2025-03-09 06:22:31,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-03-09 06:22:31,899 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2025-03-09 06:22:31,900 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 102 flow [2025-03-09 06:22:31,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:31,900 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:31,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:22:31,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:22:31,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:31,900 INFO L85 PathProgramCache]: Analyzing trace with hash 28782220, now seen corresponding path program 1 times [2025-03-09 06:22:31,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:31,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479692753] [2025-03-09 06:22:31,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:31,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:31,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:22:31,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:22:31,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:31,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:31,952 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:31,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:31,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479692753] [2025-03-09 06:22:31,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479692753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:31,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:31,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:31,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020263277] [2025-03-09 06:22:31,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:31,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:31,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:31,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:31,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:31,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-03-09 06:22:31,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:31,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-03-09 06:22:31,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:32,094 INFO L124 PetriNetUnfolderBase]: 412/937 cut-off events. [2025-03-09 06:22:32,094 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-09 06:22:32,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 937 events. 412/937 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5625 event pairs, 72 based on Foata normal form. 24/889 useless extension candidates. Maximal degree in co-relation 1135. Up to 472 conditions per place. [2025-03-09 06:22:32,101 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 30 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2025-03-09 06:22:32,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 188 flow [2025-03-09 06:22:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-09 06:22:32,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-09 06:22:32,102 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 102 flow. Second operand 3 states and 102 transitions. [2025-03-09 06:22:32,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 188 flow [2025-03-09 06:22:32,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:32,103 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 100 flow [2025-03-09 06:22:32,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2025-03-09 06:22:32,104 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2025-03-09 06:22:32,104 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 100 flow [2025-03-09 06:22:32,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:32,104 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-09 06:22:32,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:22:32,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:22:32,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:32,107 INFO L85 PathProgramCache]: Analyzing trace with hash 892236499, now seen corresponding path program 1 times [2025-03-09 06:22:32,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:32,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232500214] [2025-03-09 06:22:32,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:32,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:32,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:32,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:32,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:32,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:32,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:22:32,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:32,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:32,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:32,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:32,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:22:32,132 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:22:32,132 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-09 06:22:32,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-09 06:22:32,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-09 06:22:32,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-09 06:22:32,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-09 06:22:32,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-09 06:22:32,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-09 06:22:32,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-09 06:22:32,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-09 06:22:32,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-09 06:22:32,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-09 06:22:32,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-09 06:22:32,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-09 06:22:32,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:22:32,133 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 06:22:32,134 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:22:32,134 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 06:22:32,157 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:22:32,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 74 transitions, 166 flow [2025-03-09 06:22:32,170 INFO L124 PetriNetUnfolderBase]: 12/82 cut-off events. [2025-03-09 06:22:32,170 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 06:22:32,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 82 events. 12/82 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 273 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 69. Up to 4 conditions per place. [2025-03-09 06:22:32,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 74 transitions, 166 flow [2025-03-09 06:22:32,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 74 transitions, 166 flow [2025-03-09 06:22:32,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:22:32,173 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;@110ef022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:22:32,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-09 06:22:32,175 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:22:32,175 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-09 06:22:32,175 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:22:32,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:32,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:22:32,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:32,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:32,176 INFO L85 PathProgramCache]: Analyzing trace with hash 320344151, now seen corresponding path program 1 times [2025-03-09 06:22:32,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:32,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101842856] [2025-03-09 06:22:32,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:32,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:32,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:22:32,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:22:32,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:32,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:32,219 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,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:32,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101842856] [2025-03-09 06:22:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101842856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:32,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:32,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:32,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942844572] [2025-03-09 06:22:32,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:32,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:32,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:32,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:32,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:32,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-09 06:22:32,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 74 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:32,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-09 06:22:32,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:32,962 INFO L124 PetriNetUnfolderBase]: 5317/9887 cut-off events. [2025-03-09 06:22:32,963 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2025-03-09 06:22:32,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17250 conditions, 9887 events. 5317/9887 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 80961 event pairs, 806 based on Foata normal form. 1648/10785 useless extension candidates. Maximal degree in co-relation 6526. Up to 5693 conditions per place. [2025-03-09 06:22:33,028 INFO L140 encePairwiseOnDemand]: 64/74 looper letters, 49 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2025-03-09 06:22:33,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 304 flow [2025-03-09 06:22:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-03-09 06:22:33,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7612612612612613 [2025-03-09 06:22:33,031 INFO L175 Difference]: Start difference. First operand has 69 places, 74 transitions, 166 flow. Second operand 3 states and 169 transitions. [2025-03-09 06:22:33,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 304 flow [2025-03-09 06:22:33,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 300 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-09 06:22:33,035 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 152 flow [2025-03-09 06:22:33,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2025-03-09 06:22:33,036 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places. [2025-03-09 06:22:33,036 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 152 flow [2025-03-09 06:22:33,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:33,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:22:33,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:22:33,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:33,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1340734411, now seen corresponding path program 1 times [2025-03-09 06:22:33,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:33,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132867255] [2025-03-09 06:22:33,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:33,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:33,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:33,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:33,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:33,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:33,086 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:33,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:33,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132867255] [2025-03-09 06:22:33,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132867255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:33,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:33,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:33,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116298231] [2025-03-09 06:22:33,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:33,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:33,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:33,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:33,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:33,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-09 06:22:33,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:33,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-09 06:22:33,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:33,703 INFO L124 PetriNetUnfolderBase]: 4754/9105 cut-off events. [2025-03-09 06:22:33,703 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2025-03-09 06:22:33,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16026 conditions, 9105 events. 4754/9105 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 75359 event pairs, 806 based on Foata normal form. 219/8589 useless extension candidates. Maximal degree in co-relation 14380. Up to 4911 conditions per place. [2025-03-09 06:22:33,780 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 48 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-03-09 06:22:33,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 85 transitions, 300 flow [2025-03-09 06:22:33,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-03-09 06:22:33,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7027027027027027 [2025-03-09 06:22:33,782 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 152 flow. Second operand 3 states and 156 transitions. [2025-03-09 06:22:33,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 85 transitions, 300 flow [2025-03-09 06:22:33,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:33,789 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 150 flow [2025-03-09 06:22:33,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-03-09 06:22:33,793 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -1 predicate places. [2025-03-09 06:22:33,793 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 150 flow [2025-03-09 06:22:33,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:33,793 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:33,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:22:33,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:33,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:33,794 INFO L85 PathProgramCache]: Analyzing trace with hash -77436596, now seen corresponding path program 1 times [2025-03-09 06:22:33,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:33,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444401558] [2025-03-09 06:22:33,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:33,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:33,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:22:33,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:22:33,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:33,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:33,850 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:33,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:33,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444401558] [2025-03-09 06:22:33,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444401558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:33,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:33,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:33,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563412460] [2025-03-09 06:22:33,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:33,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:33,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:33,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:33,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:33,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-09 06:22:33,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:33,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-09 06:22:33,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:34,573 INFO L124 PetriNetUnfolderBase]: 5320/9847 cut-off events. [2025-03-09 06:22:34,575 INFO L125 PetriNetUnfolderBase]: For 751/751 co-relation queries the response was YES. [2025-03-09 06:22:34,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17622 conditions, 9847 events. 5320/9847 cut-off events. For 751/751 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 79938 event pairs, 824 based on Foata normal form. 216/9359 useless extension candidates. Maximal degree in co-relation 12822. Up to 5648 conditions per place. [2025-03-09 06:22:34,625 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 48 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2025-03-09 06:22:34,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 295 flow [2025-03-09 06:22:34,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-03-09 06:22:34,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7027027027027027 [2025-03-09 06:22:34,627 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 150 flow. Second operand 3 states and 156 transitions. [2025-03-09 06:22:34,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 295 flow [2025-03-09 06:22:34,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:34,632 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 148 flow [2025-03-09 06:22:34,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2025-03-09 06:22:34,635 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -2 predicate places. [2025-03-09 06:22:34,635 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 148 flow [2025-03-09 06:22:34,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:34,635 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:34,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:22:34,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:34,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:34,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1894433164, now seen corresponding path program 1 times [2025-03-09 06:22:34,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:34,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648615193] [2025-03-09 06:22:34,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:34,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:34,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:34,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:34,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:34,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:34,687 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,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648615193] [2025-03-09 06:22:34,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648615193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:34,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:34,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:34,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061322376] [2025-03-09 06:22:34,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:34,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:34,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:34,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:34,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:34,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-09 06:22:34,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:34,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-09 06:22:34,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:35,167 INFO L124 PetriNetUnfolderBase]: 4718/8669 cut-off events. [2025-03-09 06:22:35,168 INFO L125 PetriNetUnfolderBase]: For 664/664 co-relation queries the response was YES. [2025-03-09 06:22:35,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15584 conditions, 8669 events. 4718/8669 cut-off events. For 664/664 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 67291 event pairs, 1400 based on Foata normal form. 216/8157 useless extension candidates. Maximal degree in co-relation 7276. Up to 4872 conditions per place. [2025-03-09 06:22:35,219 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 47 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2025-03-09 06:22:35,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 287 flow [2025-03-09 06:22:35,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-09 06:22:35,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2025-03-09 06:22:35,221 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 148 flow. Second operand 3 states and 155 transitions. [2025-03-09 06:22:35,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 287 flow [2025-03-09 06:22:35,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:35,224 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 146 flow [2025-03-09 06:22:35,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-03-09 06:22:35,225 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2025-03-09 06:22:35,225 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 146 flow [2025-03-09 06:22:35,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:35,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:35,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:35,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:22:35,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:35,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:35,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1376690882, now seen corresponding path program 1 times [2025-03-09 06:22:35,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:35,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306410323] [2025-03-09 06:22:35,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:35,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:35,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:35,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:35,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:35,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:35,294 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:35,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:35,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306410323] [2025-03-09 06:22:35,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306410323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:35,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:35,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:22:35,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429963816] [2025-03-09 06:22:35,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:35,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:22:35,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:35,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:22:35,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:22:35,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-09 06:22:35,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:35,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:35,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-09 06:22:35,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:35,769 INFO L124 PetriNetUnfolderBase]: 5212/9269 cut-off events. [2025-03-09 06:22:35,769 INFO L125 PetriNetUnfolderBase]: For 745/745 co-relation queries the response was YES. [2025-03-09 06:22:35,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17047 conditions, 9269 events. 5212/9269 cut-off events. For 745/745 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 71575 event pairs, 1880 based on Foata normal form. 219/8564 useless extension candidates. Maximal degree in co-relation 16694. Up to 4129 conditions per place. [2025-03-09 06:22:35,811 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 67 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2025-03-09 06:22:35,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 102 transitions, 394 flow [2025-03-09 06:22:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:22:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:22:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2025-03-09 06:22:35,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2025-03-09 06:22:35,812 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 146 flow. Second operand 4 states and 212 transitions. [2025-03-09 06:22:35,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 102 transitions, 394 flow [2025-03-09 06:22:35,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:35,822 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 148 flow [2025-03-09 06:22:35,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2025-03-09 06:22:35,822 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2025-03-09 06:22:35,822 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 148 flow [2025-03-09 06:22:35,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:35,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:35,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:35,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 06:22:35,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:35,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:35,823 INFO L85 PathProgramCache]: Analyzing trace with hash 272255953, now seen corresponding path program 1 times [2025-03-09 06:22:35,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:35,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724325034] [2025-03-09 06:22:35,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:35,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:35,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:22:35,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:22:35,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:35,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:35,889 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:35,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:35,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724325034] [2025-03-09 06:22:35,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724325034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:35,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:35,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:22:35,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148396904] [2025-03-09 06:22:35,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:35,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:22:35,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:35,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:22:35,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:22:35,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-09 06:22:35,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:35,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:35,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-09 06:22:35,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:36,802 INFO L124 PetriNetUnfolderBase]: 8962/16346 cut-off events. [2025-03-09 06:22:36,802 INFO L125 PetriNetUnfolderBase]: For 1763/1763 co-relation queries the response was YES. [2025-03-09 06:22:36,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30244 conditions, 16346 events. 8962/16346 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 139609 event pairs, 4390 based on Foata normal form. 219/15186 useless extension candidates. Maximal degree in co-relation 14374. Up to 7261 conditions per place. [2025-03-09 06:22:36,866 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 74 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-03-09 06:22:36,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 109 transitions, 424 flow [2025-03-09 06:22:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:22:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:22:36,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2025-03-09 06:22:36,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7398648648648649 [2025-03-09 06:22:36,868 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 148 flow. Second operand 4 states and 219 transitions. [2025-03-09 06:22:36,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 109 transitions, 424 flow [2025-03-09 06:22:36,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 109 transitions, 410 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:22:36,885 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 167 flow [2025-03-09 06:22:36,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-03-09 06:22:36,885 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -1 predicate places. [2025-03-09 06:22:36,885 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 167 flow [2025-03-09 06:22:36,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:36,886 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:36,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:22:36,886 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:36,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:36,886 INFO L85 PathProgramCache]: Analyzing trace with hash -569874120, now seen corresponding path program 1 times [2025-03-09 06:22:36,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:36,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730938619] [2025-03-09 06:22:36,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:36,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:22:36,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:22:36,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:36,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:36,922 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:36,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:36,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730938619] [2025-03-09 06:22:36,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730938619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:36,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:36,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:36,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040230450] [2025-03-09 06:22:36,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:36,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:36,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:36,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:36,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:36,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-09 06:22:36,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:36,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-09 06:22:36,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:37,699 INFO L124 PetriNetUnfolderBase]: 9388/17039 cut-off events. [2025-03-09 06:22:37,700 INFO L125 PetriNetUnfolderBase]: For 3114/3258 co-relation queries the response was YES. [2025-03-09 06:22:37,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32358 conditions, 17039 events. 9388/17039 cut-off events. For 3114/3258 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 145965 event pairs, 1970 based on Foata normal form. 336/16234 useless extension candidates. Maximal degree in co-relation 18871. Up to 9128 conditions per place. [2025-03-09 06:22:37,784 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 53 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-03-09 06:22:37,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 336 flow [2025-03-09 06:22:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-09 06:22:37,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2025-03-09 06:22:37,785 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 167 flow. Second operand 3 states and 155 transitions. [2025-03-09 06:22:37,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 336 flow [2025-03-09 06:22:37,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:22:37,788 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 166 flow [2025-03-09 06:22:37,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2025-03-09 06:22:37,790 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -1 predicate places. [2025-03-09 06:22:37,790 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 166 flow [2025-03-09 06:22:37,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:37,790 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-09 06:22:37,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:22:37,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:22:37,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash -486240761, now seen corresponding path program 1 times [2025-03-09 06:22:37,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:37,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501857509] [2025-03-09 06:22:37,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:37,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:37,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:22:37,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:22:37,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:37,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:37,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:22:37,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:22:37,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:22:37,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:37,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:22:37,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:22:37,809 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:22:37,809 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-09 06:22:37,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-09 06:22:37,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-09 06:22:37,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-09 06:22:37,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-09 06:22:37,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-09 06:22:37,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-09 06:22:37,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-09 06:22:37,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-09 06:22:37,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-09 06:22:37,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-09 06:22:37,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-09 06:22:37,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-09 06:22:37,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-09 06:22:37,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-09 06:22:37,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-09 06:22:37,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-09 06:22:37,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 06:22:37,810 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:37,810 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:22:37,810 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-09 06:22:37,842 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:22:37,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 97 transitions, 222 flow [2025-03-09 06:22:37,852 INFO L124 PetriNetUnfolderBase]: 16/108 cut-off events. [2025-03-09 06:22:37,852 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 06:22:37,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 108 events. 16/108 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 377 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 94. Up to 5 conditions per place. [2025-03-09 06:22:37,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 97 transitions, 222 flow [2025-03-09 06:22:37,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 97 transitions, 222 flow [2025-03-09 06:22:37,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:22:37,856 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;@110ef022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:22:37,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-09 06:22:37,858 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:22:37,858 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-09 06:22:37,858 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:22:37,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:37,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:22:37,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:22:37,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:37,859 INFO L85 PathProgramCache]: Analyzing trace with hash 412933582, now seen corresponding path program 1 times [2025-03-09 06:22:37,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:37,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90730295] [2025-03-09 06:22:37,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:37,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:37,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:22:37,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:22:37,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:37,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:37,884 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:37,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:37,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90730295] [2025-03-09 06:22:37,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90730295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:37,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:37,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:37,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207176536] [2025-03-09 06:22:37,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:37,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:37,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:37,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:37,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:37,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-09 06:22:37,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 97 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:37,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:37,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-09 06:22:37,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:43,152 INFO L124 PetriNetUnfolderBase]: 58261/94975 cut-off events. [2025-03-09 06:22:43,152 INFO L125 PetriNetUnfolderBase]: For 6417/6417 co-relation queries the response was YES. [2025-03-09 06:22:43,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170307 conditions, 94975 events. 58261/94975 cut-off events. For 6417/6417 co-relation queries the response was YES. Maximal size of possible extension queue 4010. Compared 897942 event pairs, 9510 based on Foata normal form. 19220/107997 useless extension candidates. Maximal degree in co-relation 30712. Up to 57853 conditions per place. [2025-03-09 06:22:43,688 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 67 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2025-03-09 06:22:43,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 116 transitions, 419 flow [2025-03-09 06:22:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2025-03-09 06:22:43,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7800687285223368 [2025-03-09 06:22:43,690 INFO L175 Difference]: Start difference. First operand has 90 places, 97 transitions, 222 flow. Second operand 3 states and 227 transitions. [2025-03-09 06:22:43,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 116 transitions, 419 flow [2025-03-09 06:22:43,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 407 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-09 06:22:43,694 INFO L231 Difference]: Finished difference. Result has 90 places, 87 transitions, 200 flow [2025-03-09 06:22:43,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=90, PETRI_TRANSITIONS=87} [2025-03-09 06:22:43,694 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 0 predicate places. [2025-03-09 06:22:43,695 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 200 flow [2025-03-09 06:22:43,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:43,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:43,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:22:43,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 06:22:43,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:22:43,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:43,695 INFO L85 PathProgramCache]: Analyzing trace with hash -83960405, now seen corresponding path program 1 times [2025-03-09 06:22:43,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:43,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273613344] [2025-03-09 06:22:43,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:43,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:43,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:22:43,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:22:43,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:43,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:43,723 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:43,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:43,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273613344] [2025-03-09 06:22:43,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273613344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:43,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:43,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:43,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194884370] [2025-03-09 06:22:43,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:43,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:43,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:43,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:43,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:43,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-09 06:22:43,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:43,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:43,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-09 06:22:43,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:48,366 INFO L124 PetriNetUnfolderBase]: 52002/86961 cut-off events. [2025-03-09 06:22:48,366 INFO L125 PetriNetUnfolderBase]: For 5479/5479 co-relation queries the response was YES. [2025-03-09 06:22:48,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156347 conditions, 86961 events. 52002/86961 cut-off events. For 5479/5479 co-relation queries the response was YES. Maximal size of possible extension queue 3680. Compared 838066 event pairs, 9510 based on Foata normal form. 1755/82605 useless extension candidates. Maximal degree in co-relation 140780. Up to 49839 conditions per place. [2025-03-09 06:22:48,894 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 66 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2025-03-09 06:22:48,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 115 transitions, 407 flow [2025-03-09 06:22:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-03-09 06:22:48,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7216494845360825 [2025-03-09 06:22:48,895 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 200 flow. Second operand 3 states and 210 transitions. [2025-03-09 06:22:48,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 115 transitions, 407 flow [2025-03-09 06:22:48,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 115 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:48,904 INFO L231 Difference]: Finished difference. Result has 89 places, 86 transitions, 198 flow [2025-03-09 06:22:48,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=89, PETRI_TRANSITIONS=86} [2025-03-09 06:22:48,904 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -1 predicate places. [2025-03-09 06:22:48,904 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 86 transitions, 198 flow [2025-03-09 06:22:48,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:22:48,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:48,905 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:48,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 06:22:48,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:22:48,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:48,905 INFO L85 PathProgramCache]: Analyzing trace with hash 864443596, now seen corresponding path program 1 times [2025-03-09 06:22:48,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:48,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78881628] [2025-03-09 06:22:48,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:48,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:48,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:22:48,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:22:48,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:48,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:48,944 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:48,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:48,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78881628] [2025-03-09 06:22:48,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78881628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:48,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:48,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:48,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105729899] [2025-03-09 06:22:48,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:48,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:48,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:48,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:48,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:48,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-09 06:22:48,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:48,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:48,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-09 06:22:48,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:54,281 INFO L124 PetriNetUnfolderBase]: 57886/92803 cut-off events. [2025-03-09 06:22:54,281 INFO L125 PetriNetUnfolderBase]: For 6269/6269 co-relation queries the response was YES. [2025-03-09 06:22:54,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170851 conditions, 92803 events. 57886/92803 cut-off events. For 6269/6269 co-relation queries the response was YES. Maximal size of possible extension queue 4059. Compared 842456 event pairs, 23016 based on Foata normal form. 1752/87314 useless extension candidates. Maximal degree in co-relation 125149. Up to 57808 conditions per place. [2025-03-09 06:22:54,809 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 66 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-03-09 06:22:54,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 113 transitions, 402 flow [2025-03-09 06:22:54,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:22:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:22:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-03-09 06:22:54,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7216494845360825 [2025-03-09 06:22:54,811 INFO L175 Difference]: Start difference. First operand has 89 places, 86 transitions, 198 flow. Second operand 3 states and 210 transitions. [2025-03-09 06:22:54,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 113 transitions, 402 flow [2025-03-09 06:22:54,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 113 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:22:54,824 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 196 flow [2025-03-09 06:22:54,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2025-03-09 06:22:54,825 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -2 predicate places. [2025-03-09 06:22:54,825 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 196 flow [2025-03-09 06:22:54,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:54,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:54,825 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:54,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:22:54,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:22:54,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1027948163, now seen corresponding path program 1 times [2025-03-09 06:22:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:54,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832595843] [2025-03-09 06:22:54,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:54,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:54,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:22:54,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:22:54,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:54,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:54,852 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:54,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:54,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832595843] [2025-03-09 06:22:54,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832595843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:22:54,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:22:54,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:22:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120051772] [2025-03-09 06:22:54,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:22:54,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:22:54,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:22:54,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:22:54,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:22:54,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-09 06:22:54,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:54,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:22:54,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-09 06:22:54,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:22:59,370 INFO L124 PetriNetUnfolderBase]: 51412/82771 cut-off events. [2025-03-09 06:22:59,371 INFO L125 PetriNetUnfolderBase]: For 5600/5600 co-relation queries the response was YES. [2025-03-09 06:22:59,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152151 conditions, 82771 events. 51412/82771 cut-off events. For 5600/5600 co-relation queries the response was YES. Maximal size of possible extension queue 3597. Compared 743915 event pairs, 20568 based on Foata normal form. 1752/77997 useless extension candidates. Maximal degree in co-relation 72464. Up to 49800 conditions per place. [2025-03-09 06:23:00,042 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 65 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2025-03-09 06:23:00,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 112 transitions, 394 flow [2025-03-09 06:23:00,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:23:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:23:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-03-09 06:23:00,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.718213058419244 [2025-03-09 06:23:00,043 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 196 flow. Second operand 3 states and 209 transitions. [2025-03-09 06:23:00,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 112 transitions, 394 flow [2025-03-09 06:23:00,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:23:00,050 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 194 flow [2025-03-09 06:23:00,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2025-03-09 06:23:00,051 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -3 predicate places. [2025-03-09 06:23:00,051 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 194 flow [2025-03-09 06:23:00,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:00,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:23:00,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:23:00,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 06:23:00,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:23:00,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:23:00,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1593017099, now seen corresponding path program 1 times [2025-03-09 06:23:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:23:00,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066578656] [2025-03-09 06:23:00,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:23:00,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:23:00,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:23:00,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:23:00,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:23:00,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:23:00,124 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:23:00,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:23:00,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066578656] [2025-03-09 06:23:00,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066578656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:23:00,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:23:00,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:23:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70195152] [2025-03-09 06:23:00,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:23:00,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:23:00,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:23:00,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:23:00,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:23:00,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-03-09 06:23:00,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 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:00,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:23:00,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-03-09 06:23:00,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand