./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c --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/weaver/chl-array-int-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:37:15,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:37:15,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:37:15,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:37:15,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:37:15,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:37:15,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:37:15,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:37:15,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:37:15,087 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:37:15,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:37:15,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:37:15,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:37:15,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:37:15,088 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:37:15,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:37:15,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:37:15,089 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:37:15,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:37:15,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:37:15,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:37:15,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:37:15,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:37:15,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:37:15,089 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:37:15,090 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:37:15,090 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:37:15,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:37:15,090 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:37:15,090 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:37:15,090 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:37:15,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:37:15,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:37:15,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:37:15,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:37:15,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:37:15,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:37:15,091 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:37:15,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:37:15,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:37:15,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:37:15,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:37:15,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:37:15,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:37:15,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:37:15,092 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 -> 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 [2025-03-09 06:37:15,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:37:15,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:37:15,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:37:15,323 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:37:15,323 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:37:15,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-09 06:37:16,519 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfdaeae1/7b72685becad4b95839199bd468cf9f7/FLAGaffe25df7 [2025-03-09 06:37:16,752 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:37:16,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-09 06:37:16,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfdaeae1/7b72685becad4b95839199bd468cf9f7/FLAGaffe25df7 [2025-03-09 06:37:17,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfdaeae1/7b72685becad4b95839199bd468cf9f7 [2025-03-09 06:37:17,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:37:17,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:37:17,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:37:17,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:37:17,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:37:17,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:37:17" (1/1) ... [2025-03-09 06:37:17,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f99ca09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:37:17, skipping insertion in model container [2025-03-09 06:37:17,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:37:17" (1/1) ... [2025-03-09 06:37:17,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:37:17,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:37:17,231 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:37:17,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:37:17,263 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:37:17,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:37:17 WrapperNode [2025-03-09 06:37:17,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:37:17,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:37:17,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:37:17,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:37:17,269 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:37:17" (1/1) ... [2025-03-09 06:37:17,274 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:37:17" (1/1) ... [2025-03-09 06:37:17,299 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 223 [2025-03-09 06:37:17,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:37:17,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:37:17,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:37:17,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:37:17,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:37:17" (1/1) ... [2025-03-09 06:37:17,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:37:17" (1/1) ... [2025-03-09 06:37:17,312 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:37:17" (1/1) ... [2025-03-09 06:37:17,329 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-09 06:37:17,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:37:17" (1/1) ... [2025-03-09 06:37:17,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:37:17" (1/1) ... [2025-03-09 06:37:17,337 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:37:17" (1/1) ... [2025-03-09 06:37:17,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:37:17" (1/1) ... [2025-03-09 06:37:17,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:37:17" (1/1) ... [2025-03-09 06:37:17,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:37:17" (1/1) ... [2025-03-09 06:37:17,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:37:17,347 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:37:17,347 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:37:17,347 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:37:17,350 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:37:17" (1/1) ... [2025-03-09 06:37:17,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:37:17,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:17,375 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:37:17,378 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:37:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:37:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 06:37:17,395 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 06:37:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 06:37:17,395 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 06:37:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:37:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:37:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:37:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:37:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:37:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:37:17,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:37:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:37:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:37:17,396 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:37:17,464 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:37:17,466 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:37:17,864 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:37:17,865 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:37:18,060 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:37:18,061 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:37:18,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:37:18 BoogieIcfgContainer [2025-03-09 06:37:18,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:37:18,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:37:18,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:37:18,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:37:18,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:37:17" (1/3) ... [2025-03-09 06:37:18,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9e46f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:37:18, skipping insertion in model container [2025-03-09 06:37:18,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:37:17" (2/3) ... [2025-03-09 06:37:18,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9e46f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:37:18, skipping insertion in model container [2025-03-09 06:37:18,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:37:18" (3/3) ... [2025-03-09 06:37:18,069 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2025-03-09 06:37:18,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:37:18,084 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-symm.wvr.c that has 3 procedures, 77 locations, 1 initial locations, 4 loop locations, and 24 error locations. [2025-03-09 06:37:18,084 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:37:18,139 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 06:37:18,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 86 transitions, 186 flow [2025-03-09 06:37:18,203 INFO L124 PetriNetUnfolderBase]: 10/84 cut-off events. [2025-03-09 06:37:18,205 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:37:18,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 84 events. 10/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 284 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-09 06:37:18,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 86 transitions, 186 flow [2025-03-09 06:37:18,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 82 transitions, 173 flow [2025-03-09 06:37:18,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:37:18,229 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;@11da8c9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:37:18,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-09 06:37:18,234 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:37:18,235 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 06:37:18,235 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:37:18,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:18,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:37:18,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:18,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:18,240 INFO L85 PathProgramCache]: Analyzing trace with hash 643625, now seen corresponding path program 1 times [2025-03-09 06:37:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:18,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737663410] [2025-03-09 06:37:18,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:18,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:18,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:37:18,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:37:18,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:18,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:18,430 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:37:18,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:18,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737663410] [2025-03-09 06:37:18,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737663410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:18,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:18,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:37:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419546589] [2025-03-09 06:37:18,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:18,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:37:18,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:18,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:37:18,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:37:18,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-09 06:37:18,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:37:18,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:18,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-09 06:37:18,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:18,779 INFO L124 PetriNetUnfolderBase]: 501/1325 cut-off events. [2025-03-09 06:37:18,779 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-09 06:37:18,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2120 conditions, 1325 events. 501/1325 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9352 event pairs, 311 based on Foata normal form. 2/1039 useless extension candidates. Maximal degree in co-relation 2032. Up to 752 conditions per place. [2025-03-09 06:37:18,795 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 32 selfloop transitions, 6 changer transitions 0/80 dead transitions. [2025-03-09 06:37:18,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 80 transitions, 245 flow [2025-03-09 06:37:18,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:37:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:37:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2025-03-09 06:37:18,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-03-09 06:37:18,809 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 173 flow. Second operand 4 states and 216 transitions. [2025-03-09 06:37:18,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 80 transitions, 245 flow [2025-03-09 06:37:18,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 80 transitions, 240 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:37:18,818 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 176 flow [2025-03-09 06:37:18,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2025-03-09 06:37:18,824 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -2 predicate places. [2025-03-09 06:37:18,824 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 176 flow [2025-03-09 06:37:18,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:37:18,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:18,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 06:37:18,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:37:18,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:18,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash 19952927, now seen corresponding path program 1 times [2025-03-09 06:37:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:18,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044599922] [2025-03-09 06:37:18,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:18,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:37:18,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:37:18,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:18,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:18,881 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:37:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:18,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044599922] [2025-03-09 06:37:18,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044599922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:18,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:18,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:37:18,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008174973] [2025-03-09 06:37:18,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:18,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:37:18,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:18,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:37:18,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:37:18,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-09 06:37:18,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:37:18,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:18,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-09 06:37:18,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:19,104 INFO L124 PetriNetUnfolderBase]: 503/1333 cut-off events. [2025-03-09 06:37:19,104 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-09 06:37:19,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2133 conditions, 1333 events. 503/1333 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9418 event pairs, 311 based on Foata normal form. 2/1049 useless extension candidates. Maximal degree in co-relation 2085. Up to 761 conditions per place. [2025-03-09 06:37:19,111 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 37 selfloop transitions, 7 changer transitions 0/86 dead transitions. [2025-03-09 06:37:19,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 86 transitions, 286 flow [2025-03-09 06:37:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:37:19,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:37:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2025-03-09 06:37:19,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6453488372093024 [2025-03-09 06:37:19,113 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 176 flow. Second operand 4 states and 222 transitions. [2025-03-09 06:37:19,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 86 transitions, 286 flow [2025-03-09 06:37:19,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 86 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:37:19,116 INFO L231 Difference]: Finished difference. Result has 80 places, 86 transitions, 220 flow [2025-03-09 06:37:19,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=80, PETRI_TRANSITIONS=86} [2025-03-09 06:37:19,116 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2025-03-09 06:37:19,116 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 220 flow [2025-03-09 06:37:19,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:37:19,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:19,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:37:19,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:37:19,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:19,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1996494061, now seen corresponding path program 1 times [2025-03-09 06:37:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:19,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180060895] [2025-03-09 06:37:19,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:19,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:19,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:37:19,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:37:19,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:19,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:19,302 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:37:19,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:19,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180060895] [2025-03-09 06:37:19,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180060895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:19,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:19,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:37:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323151496] [2025-03-09 06:37:19,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:19,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:37:19,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:19,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:37:19,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:37:19,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-09 06:37:19,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:37:19,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:19,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-09 06:37:19,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:19,597 INFO L124 PetriNetUnfolderBase]: 1197/3047 cut-off events. [2025-03-09 06:37:19,598 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-09 06:37:19,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4921 conditions, 3047 events. 1197/3047 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 25189 event pairs, 742 based on Foata normal form. 23/2404 useless extension candidates. Maximal degree in co-relation 2491. Up to 919 conditions per place. [2025-03-09 06:37:19,613 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 70 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2025-03-09 06:37:19,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 117 transitions, 440 flow [2025-03-09 06:37:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:37:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:37:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 296 transitions. [2025-03-09 06:37:19,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6883720930232559 [2025-03-09 06:37:19,616 INFO L175 Difference]: Start difference. First operand has 80 places, 86 transitions, 220 flow. Second operand 5 states and 296 transitions. [2025-03-09 06:37:19,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 117 transitions, 440 flow [2025-03-09 06:37:19,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:37:19,618 INFO L231 Difference]: Finished difference. Result has 86 places, 88 transitions, 253 flow [2025-03-09 06:37:19,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=86, PETRI_TRANSITIONS=88} [2025-03-09 06:37:19,619 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 7 predicate places. [2025-03-09 06:37:19,619 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 88 transitions, 253 flow [2025-03-09 06:37:19,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:37:19,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:19,619 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-09 06:37:19,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:37:19,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:19,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:19,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1712809768, now seen corresponding path program 1 times [2025-03-09 06:37:19,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:19,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891679517] [2025-03-09 06:37:19,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:19,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:19,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:37:19,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:37:19,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:19,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:19,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891679517] [2025-03-09 06:37:19,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891679517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293346052] [2025-03-09 06:37:19,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:19,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:19,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:19,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:19,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:37:19,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:37:19,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:37:19,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:19,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:19,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:37:19,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:19,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:19,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293346052] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:19,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:19,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-09 06:37:19,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722987338] [2025-03-09 06:37:19,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:19,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:37:19,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:19,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:37:19,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:37:19,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-09 06:37:19,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 88 transitions, 253 flow. Second operand has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 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:37:19,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:19,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-09 06:37:19,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:20,220 INFO L124 PetriNetUnfolderBase]: 1014/2672 cut-off events. [2025-03-09 06:37:20,221 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-09 06:37:20,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 2672 events. 1014/2672 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 21942 event pairs, 624 based on Foata normal form. 0/2105 useless extension candidates. Maximal degree in co-relation 2198. Up to 1514 conditions per place. [2025-03-09 06:37:20,238 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 37 selfloop transitions, 25 changer transitions 0/106 dead transitions. [2025-03-09 06:37:20,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 106 transitions, 461 flow [2025-03-09 06:37:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:37:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:37:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 508 transitions. [2025-03-09 06:37:20,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5906976744186047 [2025-03-09 06:37:20,240 INFO L175 Difference]: Start difference. First operand has 86 places, 88 transitions, 253 flow. Second operand 10 states and 508 transitions. [2025-03-09 06:37:20,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 106 transitions, 461 flow [2025-03-09 06:37:20,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 106 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:37:20,245 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 415 flow [2025-03-09 06:37:20,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=415, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2025-03-09 06:37:20,245 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 18 predicate places. [2025-03-09 06:37:20,245 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 415 flow [2025-03-09 06:37:20,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 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:37:20,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:20,246 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:20,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:37:20,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:20,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:20,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:20,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1761774360, now seen corresponding path program 1 times [2025-03-09 06:37:20,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:20,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018324244] [2025-03-09 06:37:20,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:20,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:20,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:37:20,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:37:20,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:20,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:20,551 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:37:20,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:20,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018324244] [2025-03-09 06:37:20,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018324244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:20,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:20,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:37:20,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979352228] [2025-03-09 06:37:20,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:20,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:37:20,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:20,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:37:20,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:37:20,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-09 06:37:20,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:37:20,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:20,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-09 06:37:20,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:20,982 INFO L124 PetriNetUnfolderBase]: 2245/5736 cut-off events. [2025-03-09 06:37:20,982 INFO L125 PetriNetUnfolderBase]: For 535/535 co-relation queries the response was YES. [2025-03-09 06:37:20,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9560 conditions, 5736 events. 2245/5736 cut-off events. For 535/535 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 53434 event pairs, 1365 based on Foata normal form. 86/4682 useless extension candidates. Maximal degree in co-relation 9463. Up to 1691 conditions per place. [2025-03-09 06:37:21,010 INFO L140 encePairwiseOnDemand]: 79/86 looper letters, 107 selfloop transitions, 5 changer transitions 0/152 dead transitions. [2025-03-09 06:37:21,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 152 transitions, 817 flow [2025-03-09 06:37:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:37:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:37:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2025-03-09 06:37:21,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7412790697674418 [2025-03-09 06:37:21,012 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 415 flow. Second operand 4 states and 255 transitions. [2025-03-09 06:37:21,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 152 transitions, 817 flow [2025-03-09 06:37:21,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 152 transitions, 723 flow, removed 29 selfloop flow, removed 4 redundant places. [2025-03-09 06:37:21,016 INFO L231 Difference]: Finished difference. Result has 98 places, 108 transitions, 388 flow [2025-03-09 06:37:21,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=388, PETRI_PLACES=98, PETRI_TRANSITIONS=108} [2025-03-09 06:37:21,017 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2025-03-09 06:37:21,017 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 388 flow [2025-03-09 06:37:21,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:37:21,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:21,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:21,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:37:21,017 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:21,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:21,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1131259844, now seen corresponding path program 1 times [2025-03-09 06:37:21,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:21,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158149460] [2025-03-09 06:37:21,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:21,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:21,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:37:21,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:37:21,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:21,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:21,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:21,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158149460] [2025-03-09 06:37:21,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158149460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:21,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029733940] [2025-03-09 06:37:21,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:21,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:21,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:21,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:21,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:37:21,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:37:21,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:37:21,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:21,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:21,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:37:21,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:37:21,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:37:21,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029733940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:21,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:37:21,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-03-09 06:37:21,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600232591] [2025-03-09 06:37:21,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:21,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:37:21,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:21,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:37:21,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:37:21,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2025-03-09 06:37:21,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 108 transitions, 388 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:37:21,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:21,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2025-03-09 06:37:21,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:21,543 INFO L124 PetriNetUnfolderBase]: 2014/5292 cut-off events. [2025-03-09 06:37:21,543 INFO L125 PetriNetUnfolderBase]: For 486/488 co-relation queries the response was YES. [2025-03-09 06:37:21,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8554 conditions, 5292 events. 2014/5292 cut-off events. For 486/488 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 49519 event pairs, 1245 based on Foata normal form. 74/4246 useless extension candidates. Maximal degree in co-relation 8469. Up to 3046 conditions per place. [2025-03-09 06:37:21,562 INFO L140 encePairwiseOnDemand]: 83/86 looper letters, 59 selfloop transitions, 1 changer transitions 0/104 dead transitions. [2025-03-09 06:37:21,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 104 transitions, 480 flow [2025-03-09 06:37:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:37:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:37:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-03-09 06:37:21,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6821705426356589 [2025-03-09 06:37:21,563 INFO L175 Difference]: Start difference. First operand has 98 places, 108 transitions, 388 flow. Second operand 3 states and 176 transitions. [2025-03-09 06:37:21,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 104 transitions, 480 flow [2025-03-09 06:37:21,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 104 transitions, 463 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 06:37:21,566 INFO L231 Difference]: Finished difference. Result has 94 places, 104 transitions, 345 flow [2025-03-09 06:37:21,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=345, PETRI_PLACES=94, PETRI_TRANSITIONS=104} [2025-03-09 06:37:21,566 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 15 predicate places. [2025-03-09 06:37:21,566 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 345 flow [2025-03-09 06:37:21,567 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:37:21,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:21,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:21,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:37:21,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 06:37:21,768 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:21,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2141032337, now seen corresponding path program 1 times [2025-03-09 06:37:21,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:21,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640941705] [2025-03-09 06:37:21,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:21,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:21,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:37:21,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:37:21,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:21,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:21,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640941705] [2025-03-09 06:37:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640941705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062076935] [2025-03-09 06:37:21,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:21,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:21,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:21,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:21,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:37:21,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:37:21,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:37:21,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:21,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:21,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:37:21,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:37:21,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:37:21,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062076935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:21,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:37:21,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-03-09 06:37:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875240644] [2025-03-09 06:37:21,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:21,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:37:21,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:21,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:37:21,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:37:21,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2025-03-09 06:37:21,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 104 transitions, 345 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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:37:21,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:21,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2025-03-09 06:37:21,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:22,239 INFO L124 PetriNetUnfolderBase]: 2008/5280 cut-off events. [2025-03-09 06:37:22,239 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2025-03-09 06:37:22,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8505 conditions, 5280 events. 2008/5280 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 49432 event pairs, 1244 based on Foata normal form. 82/4243 useless extension candidates. Maximal degree in co-relation 8489. Up to 3035 conditions per place. [2025-03-09 06:37:22,258 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 54 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2025-03-09 06:37:22,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 100 transitions, 439 flow [2025-03-09 06:37:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:37:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:37:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2025-03-09 06:37:22,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6453488372093024 [2025-03-09 06:37:22,259 INFO L175 Difference]: Start difference. First operand has 94 places, 104 transitions, 345 flow. Second operand 4 states and 222 transitions. [2025-03-09 06:37:22,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 100 transitions, 439 flow [2025-03-09 06:37:22,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 100 transitions, 433 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:37:22,261 INFO L231 Difference]: Finished difference. Result has 91 places, 100 transitions, 325 flow [2025-03-09 06:37:22,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=91, PETRI_TRANSITIONS=100} [2025-03-09 06:37:22,261 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 12 predicate places. [2025-03-09 06:37:22,261 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 100 transitions, 325 flow [2025-03-09 06:37:22,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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:37:22,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:22,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:22,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:37:22,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:22,466 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:22,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:22,467 INFO L85 PathProgramCache]: Analyzing trace with hash 520273969, now seen corresponding path program 1 times [2025-03-09 06:37:22,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:22,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341383858] [2025-03-09 06:37:22,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:22,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:22,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:37:22,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:37:22,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:22,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:22,508 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:37:22,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:22,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341383858] [2025-03-09 06:37:22,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341383858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:22,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:22,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:37:22,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766907485] [2025-03-09 06:37:22,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:22,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:37:22,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:22,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:37:22,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:37:22,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2025-03-09 06:37:22,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 100 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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:37:22,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:22,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2025-03-09 06:37:22,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:23,103 INFO L124 PetriNetUnfolderBase]: 4048/9664 cut-off events. [2025-03-09 06:37:23,104 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-03-09 06:37:23,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16050 conditions, 9664 events. 4048/9664 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 93543 event pairs, 1796 based on Foata normal form. 104/7926 useless extension candidates. Maximal degree in co-relation 16036. Up to 3407 conditions per place. [2025-03-09 06:37:23,133 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 100 selfloop transitions, 3 changer transitions 0/141 dead transitions. [2025-03-09 06:37:23,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 141 transitions, 618 flow [2025-03-09 06:37:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:37:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:37:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2025-03-09 06:37:23,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7703488372093024 [2025-03-09 06:37:23,137 INFO L175 Difference]: Start difference. First operand has 91 places, 100 transitions, 325 flow. Second operand 4 states and 265 transitions. [2025-03-09 06:37:23,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 141 transitions, 618 flow [2025-03-09 06:37:23,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 141 transitions, 611 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:37:23,139 INFO L231 Difference]: Finished difference. Result has 94 places, 102 transitions, 340 flow [2025-03-09 06:37:23,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=94, PETRI_TRANSITIONS=102} [2025-03-09 06:37:23,140 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 15 predicate places. [2025-03-09 06:37:23,140 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 102 transitions, 340 flow [2025-03-09 06:37:23,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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:37:23,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:23,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:23,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:37:23,142 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:23,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:23,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1051374463, now seen corresponding path program 1 times [2025-03-09 06:37:23,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:23,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706287711] [2025-03-09 06:37:23,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:23,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:23,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:37:23,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:37:23,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:23,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:23,182 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:37:23,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:23,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706287711] [2025-03-09 06:37:23,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706287711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:23,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:23,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:37:23,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510398535] [2025-03-09 06:37:23,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:23,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:37:23,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:23,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:37:23,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:37:23,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-09 06:37:23,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 102 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:37:23,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:23,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-09 06:37:23,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:23,899 INFO L124 PetriNetUnfolderBase]: 6552/14644 cut-off events. [2025-03-09 06:37:23,899 INFO L125 PetriNetUnfolderBase]: For 762/794 co-relation queries the response was YES. [2025-03-09 06:37:23,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25799 conditions, 14644 events. 6552/14644 cut-off events. For 762/794 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 146232 event pairs, 2228 based on Foata normal form. 416/12485 useless extension candidates. Maximal degree in co-relation 25784. Up to 5371 conditions per place. [2025-03-09 06:37:23,955 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 96 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2025-03-09 06:37:23,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 135 transitions, 612 flow [2025-03-09 06:37:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:37:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:37:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2025-03-09 06:37:23,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7151162790697675 [2025-03-09 06:37:23,957 INFO L175 Difference]: Start difference. First operand has 94 places, 102 transitions, 340 flow. Second operand 4 states and 246 transitions. [2025-03-09 06:37:23,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 135 transitions, 612 flow [2025-03-09 06:37:23,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 135 transitions, 610 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:37:23,960 INFO L231 Difference]: Finished difference. Result has 98 places, 104 transitions, 372 flow [2025-03-09 06:37:23,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=372, PETRI_PLACES=98, PETRI_TRANSITIONS=104} [2025-03-09 06:37:23,961 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2025-03-09 06:37:23,961 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 104 transitions, 372 flow [2025-03-09 06:37:23,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:37:23,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:23,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:23,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:37:23,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:23,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:23,962 INFO L85 PathProgramCache]: Analyzing trace with hash 635663584, now seen corresponding path program 1 times [2025-03-09 06:37:23,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:23,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-03-09 06:37:23,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:23,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:23,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:37:23,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:37:23,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:23,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:23,997 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:37:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:23,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-03-09 06:37:23,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109407212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:23,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:23,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:37:23,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64905397] [2025-03-09 06:37:23,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:23,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:37:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:23,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:37:23,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:37:24,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2025-03-09 06:37:24,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 104 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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:37:24,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:24,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2025-03-09 06:37:24,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:25,202 INFO L124 PetriNetUnfolderBase]: 8564/20340 cut-off events. [2025-03-09 06:37:25,202 INFO L125 PetriNetUnfolderBase]: For 4902/5598 co-relation queries the response was YES. [2025-03-09 06:37:25,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37713 conditions, 20340 events. 8564/20340 cut-off events. For 4902/5598 co-relation queries the response was YES. Maximal size of possible extension queue 1014. Compared 220278 event pairs, 3396 based on Foata normal form. 456/17781 useless extension candidates. Maximal degree in co-relation 37696. Up to 7327 conditions per place. [2025-03-09 06:37:25,283 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 109 selfloop transitions, 3 changer transitions 0/150 dead transitions. [2025-03-09 06:37:25,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 150 transitions, 750 flow [2025-03-09 06:37:25,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:37:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:37:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2025-03-09 06:37:25,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7616279069767442 [2025-03-09 06:37:25,285 INFO L175 Difference]: Start difference. First operand has 98 places, 104 transitions, 372 flow. Second operand 4 states and 262 transitions. [2025-03-09 06:37:25,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 150 transitions, 750 flow [2025-03-09 06:37:25,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 150 transitions, 750 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:37:25,303 INFO L231 Difference]: Finished difference. Result has 103 places, 106 transitions, 394 flow [2025-03-09 06:37:25,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=394, PETRI_PLACES=103, PETRI_TRANSITIONS=106} [2025-03-09 06:37:25,303 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 24 predicate places. [2025-03-09 06:37:25,304 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 106 transitions, 394 flow [2025-03-09 06:37:25,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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:37:25,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:25,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:25,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:37:25,304 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:25,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:25,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1767130646, now seen corresponding path program 1 times [2025-03-09 06:37:25,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:25,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964104188] [2025-03-09 06:37:25,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:25,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:25,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:37:25,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:37:25,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:25,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:25,378 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:37:25,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964104188] [2025-03-09 06:37:25,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964104188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:25,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:25,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:37:25,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667406459] [2025-03-09 06:37:25,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:25,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:37:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:25,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:37:25,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:37:25,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 86 [2025-03-09 06:37:25,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 106 transitions, 394 flow. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:37:25,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:25,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 86 [2025-03-09 06:37:25,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:26,081 INFO L124 PetriNetUnfolderBase]: 4512/11654 cut-off events. [2025-03-09 06:37:26,081 INFO L125 PetriNetUnfolderBase]: For 3228/3456 co-relation queries the response was YES. [2025-03-09 06:37:26,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22192 conditions, 11654 events. 4512/11654 cut-off events. For 3228/3456 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 120914 event pairs, 2814 based on Foata normal form. 172/10337 useless extension candidates. Maximal degree in co-relation 22172. Up to 6023 conditions per place. [2025-03-09 06:37:26,132 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 114 selfloop transitions, 4 changer transitions 2/160 dead transitions. [2025-03-09 06:37:26,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 160 transitions, 821 flow [2025-03-09 06:37:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:37:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:37:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 318 transitions. [2025-03-09 06:37:26,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395348837209302 [2025-03-09 06:37:26,134 INFO L175 Difference]: Start difference. First operand has 103 places, 106 transitions, 394 flow. Second operand 5 states and 318 transitions. [2025-03-09 06:37:26,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 160 transitions, 821 flow [2025-03-09 06:37:26,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 160 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:37:26,144 INFO L231 Difference]: Finished difference. Result has 108 places, 107 transitions, 411 flow [2025-03-09 06:37:26,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=108, PETRI_TRANSITIONS=107} [2025-03-09 06:37:26,145 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 29 predicate places. [2025-03-09 06:37:26,145 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 107 transitions, 411 flow [2025-03-09 06:37:26,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:37:26,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:26,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:26,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 06:37:26,145 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:26,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1769263662, now seen corresponding path program 1 times [2025-03-09 06:37:26,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:26,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713062185] [2025-03-09 06:37:26,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:26,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:26,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:37:26,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:37:26,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:26,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:26,205 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:37:26,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:26,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713062185] [2025-03-09 06:37:26,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713062185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:26,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:26,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:37:26,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957397614] [2025-03-09 06:37:26,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:26,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:37:26,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:26,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:37:26,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:37:26,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-09 06:37:26,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 107 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 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:37:26,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:26,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-09 06:37:26,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:27,172 INFO L124 PetriNetUnfolderBase]: 8114/17852 cut-off events. [2025-03-09 06:37:27,172 INFO L125 PetriNetUnfolderBase]: For 6347/6755 co-relation queries the response was YES. [2025-03-09 06:37:27,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36531 conditions, 17852 events. 8114/17852 cut-off events. For 6347/6755 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 178826 event pairs, 3072 based on Foata normal form. 648/16417 useless extension candidates. Maximal degree in co-relation 36508. Up to 6801 conditions per place. [2025-03-09 06:37:27,253 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 109 selfloop transitions, 5 changer transitions 0/148 dead transitions. [2025-03-09 06:37:27,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 148 transitions, 803 flow [2025-03-09 06:37:27,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:37:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:37:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2025-03-09 06:37:27,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7093023255813954 [2025-03-09 06:37:27,254 INFO L175 Difference]: Start difference. First operand has 108 places, 107 transitions, 411 flow. Second operand 4 states and 244 transitions. [2025-03-09 06:37:27,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 148 transitions, 803 flow [2025-03-09 06:37:27,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 148 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:37:27,290 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 440 flow [2025-03-09 06:37:27,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=440, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2025-03-09 06:37:27,290 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 32 predicate places. [2025-03-09 06:37:27,291 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 440 flow [2025-03-09 06:37:27,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 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:37:27,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:27,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:27,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:37:27,291 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:27,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash 987401989, now seen corresponding path program 1 times [2025-03-09 06:37:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:27,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567234557] [2025-03-09 06:37:27,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:27,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:37:27,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:37:27,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:27,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:27,355 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:37:27,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:27,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567234557] [2025-03-09 06:37:27,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567234557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:27,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:27,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:37:27,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105886697] [2025-03-09 06:37:27,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:27,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:37:27,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:27,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:37:27,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:37:27,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 86 [2025-03-09 06:37:27,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 440 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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:37:27,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:27,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 86 [2025-03-09 06:37:27,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:28,358 INFO L124 PetriNetUnfolderBase]: 5302/13644 cut-off events. [2025-03-09 06:37:28,358 INFO L125 PetriNetUnfolderBase]: For 6318/6722 co-relation queries the response was YES. [2025-03-09 06:37:28,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28715 conditions, 13644 events. 5302/13644 cut-off events. For 6318/6722 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 145632 event pairs, 3548 based on Foata normal form. 226/12541 useless extension candidates. Maximal degree in co-relation 28691. Up to 7629 conditions per place. [2025-03-09 06:37:28,430 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 75 selfloop transitions, 3 changer transitions 21/139 dead transitions. [2025-03-09 06:37:28,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 139 transitions, 754 flow [2025-03-09 06:37:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:37:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:37:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2025-03-09 06:37:28,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6953488372093023 [2025-03-09 06:37:28,432 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 440 flow. Second operand 5 states and 299 transitions. [2025-03-09 06:37:28,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 139 transitions, 754 flow [2025-03-09 06:37:28,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 139 transitions, 754 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:37:28,484 INFO L231 Difference]: Finished difference. Result has 117 places, 108 transitions, 443 flow [2025-03-09 06:37:28,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=443, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2025-03-09 06:37:28,485 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 38 predicate places. [2025-03-09 06:37:28,485 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 443 flow [2025-03-09 06:37:28,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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:37:28,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:28,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:28,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:37:28,485 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:28,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:28,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1871781663, now seen corresponding path program 1 times [2025-03-09 06:37:28,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:28,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629081601] [2025-03-09 06:37:28,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:28,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:28,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:37:28,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:37:28,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:28,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:37:28,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:28,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629081601] [2025-03-09 06:37:28,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629081601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:28,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:28,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:37:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603081498] [2025-03-09 06:37:28,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:28,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:37:28,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:28,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:37:28,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:37:28,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 86 [2025-03-09 06:37:28,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 443 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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:37:28,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:28,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 86 [2025-03-09 06:37:28,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:29,144 INFO L124 PetriNetUnfolderBase]: 2930/7615 cut-off events. [2025-03-09 06:37:29,145 INFO L125 PetriNetUnfolderBase]: For 3701/3909 co-relation queries the response was YES. [2025-03-09 06:37:29,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16215 conditions, 7615 events. 2930/7615 cut-off events. For 3701/3909 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 73375 event pairs, 1882 based on Foata normal form. 148/7038 useless extension candidates. Maximal degree in co-relation 16187. Up to 3835 conditions per place. [2025-03-09 06:37:29,177 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 101 selfloop transitions, 8 changer transitions 2/151 dead transitions. [2025-03-09 06:37:29,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 151 transitions, 829 flow [2025-03-09 06:37:29,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:37:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:37:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 315 transitions. [2025-03-09 06:37:29,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7325581395348837 [2025-03-09 06:37:29,178 INFO L175 Difference]: Start difference. First operand has 117 places, 108 transitions, 443 flow. Second operand 5 states and 315 transitions. [2025-03-09 06:37:29,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 151 transitions, 829 flow [2025-03-09 06:37:29,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 151 transitions, 816 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-09 06:37:29,196 INFO L231 Difference]: Finished difference. Result has 117 places, 109 transitions, 463 flow [2025-03-09 06:37:29,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=463, PETRI_PLACES=117, PETRI_TRANSITIONS=109} [2025-03-09 06:37:29,197 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 38 predicate places. [2025-03-09 06:37:29,197 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 109 transitions, 463 flow [2025-03-09 06:37:29,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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:37:29,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:29,197 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-09 06:37:29,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 06:37:29,198 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:29,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:29,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1599544287, now seen corresponding path program 2 times [2025-03-09 06:37:29,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:29,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319176392] [2025-03-09 06:37:29,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:37:29,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:29,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 06:37:29,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-09 06:37:29,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:37:29,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:37:29,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:29,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319176392] [2025-03-09 06:37:29,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319176392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:29,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646812706] [2025-03-09 06:37:29,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:37:29,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:29,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:29,237 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:29,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:37:29,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 06:37:29,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-09 06:37:29,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:37:29,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:29,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:37:29,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:37:29,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:37:29,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646812706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:29,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:29,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-09 06:37:29,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967039731] [2025-03-09 06:37:29,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:29,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:37:29,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:29,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:37:29,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:37:29,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-09 06:37:29,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 463 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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:37:29,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:29,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-09 06:37:29,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:29,746 INFO L124 PetriNetUnfolderBase]: 2934/7620 cut-off events. [2025-03-09 06:37:29,746 INFO L125 PetriNetUnfolderBase]: For 4036/4246 co-relation queries the response was YES. [2025-03-09 06:37:29,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16255 conditions, 7620 events. 2934/7620 cut-off events. For 4036/4246 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 73246 event pairs, 2005 based on Foata normal form. 103/6987 useless extension candidates. Maximal degree in co-relation 16228. Up to 4356 conditions per place. [2025-03-09 06:37:29,782 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 54 selfloop transitions, 16 changer transitions 0/108 dead transitions. [2025-03-09 06:37:29,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 108 transitions, 593 flow [2025-03-09 06:37:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:37:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:37:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-03-09 06:37:29,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.622093023255814 [2025-03-09 06:37:29,783 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 463 flow. Second operand 4 states and 214 transitions. [2025-03-09 06:37:29,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 108 transitions, 593 flow [2025-03-09 06:37:29,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 108 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:37:29,801 INFO L231 Difference]: Finished difference. Result has 117 places, 108 transitions, 472 flow [2025-03-09 06:37:29,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=472, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2025-03-09 06:37:29,801 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 38 predicate places. [2025-03-09 06:37:29,801 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 472 flow [2025-03-09 06:37:29,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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:37:29,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:29,801 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-09 06:37:29,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 06:37:30,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 06:37:30,002 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:30,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:30,003 INFO L85 PathProgramCache]: Analyzing trace with hash 893435422, now seen corresponding path program 1 times [2025-03-09 06:37:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:30,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64727775] [2025-03-09 06:37:30,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:30,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:37:30,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:37:30,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:30,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:30,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:30,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64727775] [2025-03-09 06:37:30,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64727775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:30,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877615060] [2025-03-09 06:37:30,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:30,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:30,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:30,128 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:30,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:37:30,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:37:30,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:37:30,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:30,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:30,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:37:30,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:30,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:30,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877615060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:30,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:30,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-09 06:37:30,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021644681] [2025-03-09 06:37:30,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:30,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 06:37:30,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:30,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 06:37:30,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-09 06:37:30,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-09 06:37:30,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 472 flow. Second operand has 24 states, 24 states have (on average 45.083333333333336) internal successors, (1082), 24 states have internal predecessors, (1082), 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:37:30,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:30,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-09 06:37:30,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:31,085 INFO L124 PetriNetUnfolderBase]: 2951/7581 cut-off events. [2025-03-09 06:37:31,085 INFO L125 PetriNetUnfolderBase]: For 4302/4522 co-relation queries the response was YES. [2025-03-09 06:37:31,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16330 conditions, 7581 events. 2951/7581 cut-off events. For 4302/4522 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 72434 event pairs, 1996 based on Foata normal form. 114/6956 useless extension candidates. Maximal degree in co-relation 16302. Up to 4361 conditions per place. [2025-03-09 06:37:31,112 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 45 selfloop transitions, 61 changer transitions 0/144 dead transitions. [2025-03-09 06:37:31,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 144 transitions, 900 flow [2025-03-09 06:37:31,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 06:37:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 06:37:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1071 transitions. [2025-03-09 06:37:31,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5660676532769556 [2025-03-09 06:37:31,118 INFO L175 Difference]: Start difference. First operand has 117 places, 108 transitions, 472 flow. Second operand 22 states and 1071 transitions. [2025-03-09 06:37:31,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 144 transitions, 900 flow [2025-03-09 06:37:31,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 144 transitions, 832 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:37:31,134 INFO L231 Difference]: Finished difference. Result has 141 places, 144 transitions, 788 flow [2025-03-09 06:37:31,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=788, PETRI_PLACES=141, PETRI_TRANSITIONS=144} [2025-03-09 06:37:31,135 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 62 predicate places. [2025-03-09 06:37:31,135 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 144 transitions, 788 flow [2025-03-09 06:37:31,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 45.083333333333336) internal successors, (1082), 24 states have internal predecessors, (1082), 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:37:31,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:31,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:31,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 06:37:31,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 06:37:31,340 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:31,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:31,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1522185778, now seen corresponding path program 1 times [2025-03-09 06:37:31,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:31,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140322089] [2025-03-09 06:37:31,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:31,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:31,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:37:31,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:37:31,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:31,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:37:31,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:31,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140322089] [2025-03-09 06:37:31,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140322089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:31,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:31,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:37:31,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816803633] [2025-03-09 06:37:31,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:31,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:37:31,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:31,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:37:31,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:37:31,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 86 [2025-03-09 06:37:31,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 144 transitions, 788 flow. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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:37:31,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:31,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 86 [2025-03-09 06:37:31,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:31,826 INFO L124 PetriNetUnfolderBase]: 2671/6902 cut-off events. [2025-03-09 06:37:31,827 INFO L125 PetriNetUnfolderBase]: For 3689/3895 co-relation queries the response was YES. [2025-03-09 06:37:31,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14895 conditions, 6902 events. 2671/6902 cut-off events. For 3689/3895 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 65528 event pairs, 1770 based on Foata normal form. 109/6346 useless extension candidates. Maximal degree in co-relation 14861. Up to 3883 conditions per place. [2025-03-09 06:37:31,863 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 91 selfloop transitions, 12 changer transitions 17/159 dead transitions. [2025-03-09 06:37:31,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 159 transitions, 1075 flow [2025-03-09 06:37:31,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:37:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:37:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 296 transitions. [2025-03-09 06:37:31,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6883720930232559 [2025-03-09 06:37:31,864 INFO L175 Difference]: Start difference. First operand has 141 places, 144 transitions, 788 flow. Second operand 5 states and 296 transitions. [2025-03-09 06:37:31,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 159 transitions, 1075 flow [2025-03-09 06:37:31,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 159 transitions, 919 flow, removed 47 selfloop flow, removed 9 redundant places. [2025-03-09 06:37:31,881 INFO L231 Difference]: Finished difference. Result has 138 places, 142 transitions, 642 flow [2025-03-09 06:37:31,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=642, PETRI_PLACES=138, PETRI_TRANSITIONS=142} [2025-03-09 06:37:31,882 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 59 predicate places. [2025-03-09 06:37:31,882 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 142 transitions, 642 flow [2025-03-09 06:37:31,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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:37:31,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:31,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:31,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:37:31,882 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:31,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash 236239364, now seen corresponding path program 1 times [2025-03-09 06:37:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:31,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908212762] [2025-03-09 06:37:31,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:31,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:37:31,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:37:31,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:31,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:32,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:32,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908212762] [2025-03-09 06:37:32,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908212762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:32,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166557519] [2025-03-09 06:37:32,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:32,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:32,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:32,090 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:32,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 06:37:32,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:37:32,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:37:32,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:32,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:32,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:37:32,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:32,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:37:32,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:37:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:32,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:32,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-09 06:37:32,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-09 06:37:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:32,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166557519] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:32,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:32,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 06:37:32,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686494394] [2025-03-09 06:37:32,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:32,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 06:37:32,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:32,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 06:37:32,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:37:32,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 86 [2025-03-09 06:37:32,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 142 transitions, 642 flow. Second operand has 15 states, 15 states have (on average 47.06666666666667) internal successors, (706), 15 states have internal predecessors, (706), 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:37:32,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:32,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 86 [2025-03-09 06:37:32,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:33,020 INFO L124 PetriNetUnfolderBase]: 3052/7568 cut-off events. [2025-03-09 06:37:33,021 INFO L125 PetriNetUnfolderBase]: For 4216/4447 co-relation queries the response was YES. [2025-03-09 06:37:33,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16550 conditions, 7568 events. 3052/7568 cut-off events. For 4216/4447 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 71252 event pairs, 918 based on Foata normal form. 100/6926 useless extension candidates. Maximal degree in co-relation 16515. Up to 1638 conditions per place. [2025-03-09 06:37:33,066 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 161 selfloop transitions, 35 changer transitions 0/233 dead transitions. [2025-03-09 06:37:33,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 233 transitions, 1393 flow [2025-03-09 06:37:33,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:37:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:37:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 571 transitions. [2025-03-09 06:37:33,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.663953488372093 [2025-03-09 06:37:33,068 INFO L175 Difference]: Start difference. First operand has 138 places, 142 transitions, 642 flow. Second operand 10 states and 571 transitions. [2025-03-09 06:37:33,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 233 transitions, 1393 flow [2025-03-09 06:37:33,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 233 transitions, 1343 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-03-09 06:37:33,087 INFO L231 Difference]: Finished difference. Result has 139 places, 149 transitions, 747 flow [2025-03-09 06:37:33,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=747, PETRI_PLACES=139, PETRI_TRANSITIONS=149} [2025-03-09 06:37:33,088 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 60 predicate places. [2025-03-09 06:37:33,088 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 149 transitions, 747 flow [2025-03-09 06:37:33,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 47.06666666666667) internal successors, (706), 15 states have internal predecessors, (706), 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:37:33,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:33,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:33,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 06:37:33,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 06:37:33,289 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:33,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1266544425, now seen corresponding path program 1 times [2025-03-09 06:37:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:33,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097087433] [2025-03-09 06:37:33,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:33,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:37:33,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:37:33,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:33,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:33,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:33,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097087433] [2025-03-09 06:37:33,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097087433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:33,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284046097] [2025-03-09 06:37:33,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:33,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:33,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:33,516 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:33,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 06:37:33,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:37:33,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:37:33,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:33,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:33,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:37:33,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:33,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:37:33,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 06:37:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:33,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:33,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-09 06:37:33,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-09 06:37:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:33,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284046097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:33,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:33,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 06:37:33,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759096479] [2025-03-09 06:37:33,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:33,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 06:37:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:33,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 06:37:33,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:37:33,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 86 [2025-03-09 06:37:33,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 149 transitions, 747 flow. Second operand has 15 states, 15 states have (on average 45.2) internal successors, (678), 15 states have internal predecessors, (678), 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:37:33,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:33,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 86 [2025-03-09 06:37:33,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:34,412 INFO L124 PetriNetUnfolderBase]: 3612/8156 cut-off events. [2025-03-09 06:37:34,412 INFO L125 PetriNetUnfolderBase]: For 7005/7302 co-relation queries the response was YES. [2025-03-09 06:37:34,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19289 conditions, 8156 events. 3612/8156 cut-off events. For 7005/7302 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 73190 event pairs, 1162 based on Foata normal form. 178/7640 useless extension candidates. Maximal degree in co-relation 19254. Up to 2076 conditions per place. [2025-03-09 06:37:34,459 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 165 selfloop transitions, 35 changer transitions 0/234 dead transitions. [2025-03-09 06:37:34,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 234 transitions, 1462 flow [2025-03-09 06:37:34,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:37:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:37:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 551 transitions. [2025-03-09 06:37:34,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6406976744186047 [2025-03-09 06:37:34,461 INFO L175 Difference]: Start difference. First operand has 139 places, 149 transitions, 747 flow. Second operand 10 states and 551 transitions. [2025-03-09 06:37:34,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 234 transitions, 1462 flow [2025-03-09 06:37:34,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 234 transitions, 1442 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 06:37:34,481 INFO L231 Difference]: Finished difference. Result has 147 places, 151 transitions, 828 flow [2025-03-09 06:37:34,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=828, PETRI_PLACES=147, PETRI_TRANSITIONS=151} [2025-03-09 06:37:34,482 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 68 predicate places. [2025-03-09 06:37:34,482 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 151 transitions, 828 flow [2025-03-09 06:37:34,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 45.2) internal successors, (678), 15 states have internal predecessors, (678), 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:37:34,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:34,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:34,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 06:37:34,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:34,683 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:34,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:34,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1320304781, now seen corresponding path program 1 times [2025-03-09 06:37:34,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:34,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677328941] [2025-03-09 06:37:34,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:34,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:34,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:37:34,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:37:34,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:34,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:34,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677328941] [2025-03-09 06:37:34,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677328941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804999117] [2025-03-09 06:37:34,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:34,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:34,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:34,986 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:34,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 06:37:35,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:37:35,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:37:35,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:35,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:35,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:37:35,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:35,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:37:35,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:37:35,101 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:37:35,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:37:35,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 06:37:35,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:37:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:35,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:35,215 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_195 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_195) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2025-03-09 06:37:35,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:37:35,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-09 06:37:35,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:37:35,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-03-09 06:37:35,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-09 06:37:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-09 06:37:35,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804999117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:35,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:35,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2025-03-09 06:37:35,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938123781] [2025-03-09 06:37:35,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:35,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 06:37:35,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:35,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 06:37:35,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2025-03-09 06:37:35,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 86 [2025-03-09 06:37:35,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 151 transitions, 828 flow. Second operand has 20 states, 20 states have (on average 27.75) internal successors, (555), 20 states have internal predecessors, (555), 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:37:35,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:35,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 86 [2025-03-09 06:37:35,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:37,295 INFO L124 PetriNetUnfolderBase]: 11565/20431 cut-off events. [2025-03-09 06:37:37,295 INFO L125 PetriNetUnfolderBase]: For 29383/30759 co-relation queries the response was YES. [2025-03-09 06:37:37,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55599 conditions, 20431 events. 11565/20431 cut-off events. For 29383/30759 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 167293 event pairs, 2686 based on Foata normal form. 600/19027 useless extension candidates. Maximal degree in co-relation 55562. Up to 3021 conditions per place. [2025-03-09 06:37:37,458 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 449 selfloop transitions, 61 changer transitions 14/550 dead transitions. [2025-03-09 06:37:37,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 550 transitions, 4029 flow [2025-03-09 06:37:37,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 06:37:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-09 06:37:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 915 transitions. [2025-03-09 06:37:37,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4433139534883721 [2025-03-09 06:37:37,461 INFO L175 Difference]: Start difference. First operand has 147 places, 151 transitions, 828 flow. Second operand 24 states and 915 transitions. [2025-03-09 06:37:37,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 550 transitions, 4029 flow [2025-03-09 06:37:37,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 550 transitions, 3849 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-09 06:37:37,559 INFO L231 Difference]: Finished difference. Result has 169 places, 183 transitions, 1165 flow [2025-03-09 06:37:37,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1165, PETRI_PLACES=169, PETRI_TRANSITIONS=183} [2025-03-09 06:37:37,560 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 90 predicate places. [2025-03-09 06:37:37,560 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 183 transitions, 1165 flow [2025-03-09 06:37:37,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 27.75) internal successors, (555), 20 states have internal predecessors, (555), 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:37:37,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:37,561 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:37,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 06:37:37,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:37,762 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:37,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:37,763 INFO L85 PathProgramCache]: Analyzing trace with hash -638690824, now seen corresponding path program 1 times [2025-03-09 06:37:37,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:37,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513737799] [2025-03-09 06:37:37,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:37,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:37,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:37:37,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:37:37,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:37,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:37:37,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:37,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513737799] [2025-03-09 06:37:37,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513737799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:37,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292843313] [2025-03-09 06:37:37,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:37,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:37,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:37,823 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:37,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 06:37:37,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:37:37,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:37:37,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:37,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:37,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:37:37,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:37:37,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:37:38,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292843313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:38,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:38,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-03-09 06:37:38,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107999919] [2025-03-09 06:37:38,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:38,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 06:37:38,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:38,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:37:38,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:37:38,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-09 06:37:38,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 183 transitions, 1165 flow. Second operand has 19 states, 19 states have (on average 44.21052631578947) internal successors, (840), 19 states have internal predecessors, (840), 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:37:38,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:38,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-09 06:37:38,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:39,643 INFO L124 PetriNetUnfolderBase]: 4512/11362 cut-off events. [2025-03-09 06:37:39,643 INFO L125 PetriNetUnfolderBase]: For 17141/17545 co-relation queries the response was YES. [2025-03-09 06:37:39,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29296 conditions, 11362 events. 4512/11362 cut-off events. For 17141/17545 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 115264 event pairs, 1070 based on Foata normal form. 306/10681 useless extension candidates. Maximal degree in co-relation 29254. Up to 1945 conditions per place. [2025-03-09 06:37:39,721 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 309 selfloop transitions, 57 changer transitions 12/419 dead transitions. [2025-03-09 06:37:39,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 419 transitions, 3232 flow [2025-03-09 06:37:39,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 06:37:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 06:37:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 915 transitions. [2025-03-09 06:37:39,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6258549931600548 [2025-03-09 06:37:39,723 INFO L175 Difference]: Start difference. First operand has 169 places, 183 transitions, 1165 flow. Second operand 17 states and 915 transitions. [2025-03-09 06:37:39,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 419 transitions, 3232 flow [2025-03-09 06:37:39,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 419 transitions, 3115 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-09 06:37:39,779 INFO L231 Difference]: Finished difference. Result has 179 places, 206 transitions, 1445 flow [2025-03-09 06:37:39,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1445, PETRI_PLACES=179, PETRI_TRANSITIONS=206} [2025-03-09 06:37:39,779 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 100 predicate places. [2025-03-09 06:37:39,779 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 206 transitions, 1445 flow [2025-03-09 06:37:39,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 44.21052631578947) internal successors, (840), 19 states have internal predecessors, (840), 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:37:39,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:39,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:39,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 06:37:39,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:39,984 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:39,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:39,984 INFO L85 PathProgramCache]: Analyzing trace with hash -608170873, now seen corresponding path program 1 times [2025-03-09 06:37:39,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:39,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-09 06:37:39,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:39,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:39,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:37:39,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:37:39,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:39,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:37:40,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:40,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-09 06:37:40,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71091225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:40,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:40,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:37:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689253620] [2025-03-09 06:37:40,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:40,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:37:40,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:40,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:37:40,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:37:40,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-09 06:37:40,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 206 transitions, 1445 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:37:40,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:40,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-09 06:37:40,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:40,994 INFO L124 PetriNetUnfolderBase]: 5393/13025 cut-off events. [2025-03-09 06:37:40,994 INFO L125 PetriNetUnfolderBase]: For 20896/21234 co-relation queries the response was YES. [2025-03-09 06:37:41,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33912 conditions, 13025 events. 5393/13025 cut-off events. For 20896/21234 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 131617 event pairs, 2470 based on Foata normal form. 300/12139 useless extension candidates. Maximal degree in co-relation 33870. Up to 5356 conditions per place. [2025-03-09 06:37:41,056 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 232 selfloop transitions, 8 changer transitions 0/275 dead transitions. [2025-03-09 06:37:41,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 275 transitions, 2342 flow [2025-03-09 06:37:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:37:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:37:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2025-03-09 06:37:41,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7063953488372093 [2025-03-09 06:37:41,058 INFO L175 Difference]: Start difference. First operand has 179 places, 206 transitions, 1445 flow. Second operand 4 states and 243 transitions. [2025-03-09 06:37:41,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 275 transitions, 2342 flow [2025-03-09 06:37:41,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 275 transitions, 2311 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-03-09 06:37:41,113 INFO L231 Difference]: Finished difference. Result has 173 places, 204 transitions, 1413 flow [2025-03-09 06:37:41,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1413, PETRI_PLACES=173, PETRI_TRANSITIONS=204} [2025-03-09 06:37:41,114 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 94 predicate places. [2025-03-09 06:37:41,114 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 204 transitions, 1413 flow [2025-03-09 06:37:41,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:37:41,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:41,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:41,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 06:37:41,114 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:41,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:41,115 INFO L85 PathProgramCache]: Analyzing trace with hash -608171866, now seen corresponding path program 1 times [2025-03-09 06:37:41,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:41,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703703350] [2025-03-09 06:37:41,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:41,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:41,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:37:41,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:37:41,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:41,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:41,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:41,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703703350] [2025-03-09 06:37:41,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703703350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:41,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318191459] [2025-03-09 06:37:41,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:41,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:41,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:41,336 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:41,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 06:37:41,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:37:41,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:37:41,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:41,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:41,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 06:37:41,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:41,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:37:41,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:37:41,438 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:37:41,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:37:41,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 06:37:41,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 06:37:41,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:41,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:41,575 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_239 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_239) c_~a1~0.base) c_~a1~0.offset) 2147483649))) is different from false [2025-03-09 06:37:41,589 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_239 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_124| Int)) (or (< 0 (+ (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_124| v_ArrVal_239) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483649)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_124|) 0)))) is different from false [2025-03-09 06:37:41,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:37:41,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-09 06:37:41,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:37:41,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-03-09 06:37:41,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-09 06:37:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-09 06:37:41,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318191459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:41,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:41,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-09 06:37:41,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710098690] [2025-03-09 06:37:41,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:41,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 06:37:41,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:41,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 06:37:41,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=256, Unknown=2, NotChecked=66, Total=380 [2025-03-09 06:37:41,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-09 06:37:41,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 204 transitions, 1413 flow. Second operand has 20 states, 20 states have (on average 38.05) internal successors, (761), 20 states have internal predecessors, (761), 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:37:41,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:41,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-09 06:37:41,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:43,293 INFO L124 PetriNetUnfolderBase]: 7987/14276 cut-off events. [2025-03-09 06:37:43,294 INFO L125 PetriNetUnfolderBase]: For 22106/23331 co-relation queries the response was YES. [2025-03-09 06:37:43,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41316 conditions, 14276 events. 7987/14276 cut-off events. For 22106/23331 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 115088 event pairs, 1581 based on Foata normal form. 414/14048 useless extension candidates. Maximal degree in co-relation 41276. Up to 3211 conditions per place. [2025-03-09 06:37:43,377 INFO L140 encePairwiseOnDemand]: 69/86 looper letters, 418 selfloop transitions, 56 changer transitions 0/502 dead transitions. [2025-03-09 06:37:43,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 502 transitions, 4128 flow [2025-03-09 06:37:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 06:37:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 06:37:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 820 transitions. [2025-03-09 06:37:43,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.560875512995896 [2025-03-09 06:37:43,379 INFO L175 Difference]: Start difference. First operand has 173 places, 204 transitions, 1413 flow. Second operand 17 states and 820 transitions. [2025-03-09 06:37:43,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 502 transitions, 4128 flow [2025-03-09 06:37:43,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 502 transitions, 4115 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:37:43,445 INFO L231 Difference]: Finished difference. Result has 193 places, 209 transitions, 1590 flow [2025-03-09 06:37:43,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1590, PETRI_PLACES=193, PETRI_TRANSITIONS=209} [2025-03-09 06:37:43,445 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 114 predicate places. [2025-03-09 06:37:43,445 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 209 transitions, 1590 flow [2025-03-09 06:37:43,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.05) internal successors, (761), 20 states have internal predecessors, (761), 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:37:43,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:43,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:43,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 06:37:43,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 06:37:43,647 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:43,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:43,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2020194664, now seen corresponding path program 1 times [2025-03-09 06:37:43,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:43,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593780511] [2025-03-09 06:37:43,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:43,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:43,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:37:43,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:37:43,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:43,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:43,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:43,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593780511] [2025-03-09 06:37:43,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593780511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:43,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635701493] [2025-03-09 06:37:43,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:43,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:43,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:43,865 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:43,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 06:37:43,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:37:43,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:37:43,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:43,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:43,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:37:43,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:43,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:37:43,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:37:43,974 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:37:43,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:37:43,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 06:37:44,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 06:37:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:44,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:44,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:37:44,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-09 06:37:44,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:37:44,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-03-09 06:37:44,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-09 06:37:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:44,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635701493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:44,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:44,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-03-09 06:37:44,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693636581] [2025-03-09 06:37:44,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:44,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 06:37:44,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:44,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:37:44,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=278, Unknown=3, NotChecked=0, Total=342 [2025-03-09 06:37:44,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 86 [2025-03-09 06:37:44,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 209 transitions, 1590 flow. Second operand has 19 states, 19 states have (on average 40.421052631578945) internal successors, (768), 19 states have internal predecessors, (768), 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:37:44,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:44,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 86 [2025-03-09 06:37:44,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:46,130 INFO L124 PetriNetUnfolderBase]: 8481/15451 cut-off events. [2025-03-09 06:37:46,131 INFO L125 PetriNetUnfolderBase]: For 38525/39223 co-relation queries the response was YES. [2025-03-09 06:37:46,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46853 conditions, 15451 events. 8481/15451 cut-off events. For 38525/39223 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 128290 event pairs, 2583 based on Foata normal form. 460/14841 useless extension candidates. Maximal degree in co-relation 46806. Up to 5216 conditions per place. [2025-03-09 06:37:46,268 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 273 selfloop transitions, 55 changer transitions 0/360 dead transitions. [2025-03-09 06:37:46,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 360 transitions, 3309 flow [2025-03-09 06:37:46,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:37:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 06:37:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 627 transitions. [2025-03-09 06:37:46,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608228980322003 [2025-03-09 06:37:46,270 INFO L175 Difference]: Start difference. First operand has 193 places, 209 transitions, 1590 flow. Second operand 13 states and 627 transitions. [2025-03-09 06:37:46,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 360 transitions, 3309 flow [2025-03-09 06:37:46,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 360 transitions, 3137 flow, removed 15 selfloop flow, removed 11 redundant places. [2025-03-09 06:37:46,357 INFO L231 Difference]: Finished difference. Result has 196 places, 211 transitions, 1659 flow [2025-03-09 06:37:46,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1659, PETRI_PLACES=196, PETRI_TRANSITIONS=211} [2025-03-09 06:37:46,358 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 117 predicate places. [2025-03-09 06:37:46,358 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 211 transitions, 1659 flow [2025-03-09 06:37:46,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 40.421052631578945) internal successors, (768), 19 states have internal predecessors, (768), 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:37:46,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:46,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:46,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 06:37:46,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 06:37:46,559 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:46,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:46,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1673458022, now seen corresponding path program 1 times [2025-03-09 06:37:46,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:46,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72362284] [2025-03-09 06:37:46,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:46,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:37:46,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:37:46,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:46,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:46,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:46,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72362284] [2025-03-09 06:37:46,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72362284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:46,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619906080] [2025-03-09 06:37:46,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:46,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:46,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:46,762 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:46,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 06:37:46,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:37:46,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:37:46,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:46,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:46,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 06:37:46,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:46,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:37:46,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:37:46,865 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:37:46,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:37:46,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 06:37:46,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:37:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:46,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:47,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:37:47,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-09 06:37:47,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:37:47,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-03-09 06:37:47,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-09 06:37:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:37:47,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619906080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:47,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:47,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-09 06:37:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019589665] [2025-03-09 06:37:47,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:47,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 06:37:47,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:47,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 06:37:47,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=351, Unknown=5, NotChecked=0, Total=420 [2025-03-09 06:37:47,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-09 06:37:47,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 211 transitions, 1659 flow. Second operand has 21 states, 21 states have (on average 38.04761904761905) internal successors, (799), 21 states have internal predecessors, (799), 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:37:47,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:47,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-09 06:37:47,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:49,006 INFO L124 PetriNetUnfolderBase]: 8652/14985 cut-off events. [2025-03-09 06:37:49,006 INFO L125 PetriNetUnfolderBase]: For 31422/32320 co-relation queries the response was YES. [2025-03-09 06:37:49,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47300 conditions, 14985 events. 8652/14985 cut-off events. For 31422/32320 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 118469 event pairs, 1905 based on Foata normal form. 848/15293 useless extension candidates. Maximal degree in co-relation 47252. Up to 3815 conditions per place. [2025-03-09 06:37:49,110 INFO L140 encePairwiseOnDemand]: 67/86 looper letters, 417 selfloop transitions, 58 changer transitions 33/540 dead transitions. [2025-03-09 06:37:49,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 540 transitions, 4910 flow [2025-03-09 06:37:49,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 06:37:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-09 06:37:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 867 transitions. [2025-03-09 06:37:49,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.560077519379845 [2025-03-09 06:37:49,111 INFO L175 Difference]: Start difference. First operand has 196 places, 211 transitions, 1659 flow. Second operand 18 states and 867 transitions. [2025-03-09 06:37:49,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 540 transitions, 4910 flow [2025-03-09 06:37:49,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 540 transitions, 4650 flow, removed 2 selfloop flow, removed 11 redundant places. [2025-03-09 06:37:49,196 INFO L231 Difference]: Finished difference. Result has 207 places, 218 transitions, 1772 flow [2025-03-09 06:37:49,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1772, PETRI_PLACES=207, PETRI_TRANSITIONS=218} [2025-03-09 06:37:49,196 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 128 predicate places. [2025-03-09 06:37:49,196 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 218 transitions, 1772 flow [2025-03-09 06:37:49,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 38.04761904761905) internal successors, (799), 21 states have internal predecessors, (799), 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:37:49,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:49,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:49,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 06:37:49,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 06:37:49,397 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:49,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash 581098445, now seen corresponding path program 1 times [2025-03-09 06:37:49,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:49,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354236282] [2025-03-09 06:37:49,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:49,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:49,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:37:49,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:37:49,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:49,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:37:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:49,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354236282] [2025-03-09 06:37:49,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354236282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:49,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:49,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:37:49,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437161168] [2025-03-09 06:37:49,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:49,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:37:49,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:49,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:37:49,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:37:49,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-09 06:37:49,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 218 transitions, 1772 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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:37:49,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:49,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-09 06:37:49,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:50,484 INFO L124 PetriNetUnfolderBase]: 6031/13114 cut-off events. [2025-03-09 06:37:50,484 INFO L125 PetriNetUnfolderBase]: For 33303/33731 co-relation queries the response was YES. [2025-03-09 06:37:50,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41083 conditions, 13114 events. 6031/13114 cut-off events. For 33303/33731 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 123641 event pairs, 2536 based on Foata normal form. 436/12976 useless extension candidates. Maximal degree in co-relation 41032. Up to 5585 conditions per place. [2025-03-09 06:37:50,598 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 235 selfloop transitions, 10 changer transitions 0/286 dead transitions. [2025-03-09 06:37:50,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 286 transitions, 2698 flow [2025-03-09 06:37:50,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:37:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:37:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2025-03-09 06:37:50,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7005813953488372 [2025-03-09 06:37:50,599 INFO L175 Difference]: Start difference. First operand has 207 places, 218 transitions, 1772 flow. Second operand 4 states and 241 transitions. [2025-03-09 06:37:50,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 286 transitions, 2698 flow [2025-03-09 06:37:50,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 286 transitions, 2584 flow, removed 4 selfloop flow, removed 12 redundant places. [2025-03-09 06:37:50,716 INFO L231 Difference]: Finished difference. Result has 197 places, 216 transitions, 1662 flow [2025-03-09 06:37:50,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1662, PETRI_PLACES=197, PETRI_TRANSITIONS=216} [2025-03-09 06:37:50,717 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 118 predicate places. [2025-03-09 06:37:50,717 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 216 transitions, 1662 flow [2025-03-09 06:37:50,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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:37:50,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:50,717 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:50,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 06:37:50,717 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:50,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:50,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1828994137, now seen corresponding path program 1 times [2025-03-09 06:37:50,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:50,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684944187] [2025-03-09 06:37:50,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:50,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:50,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:37:50,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:37:50,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:50,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:37:50,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:50,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684944187] [2025-03-09 06:37:50,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684944187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:50,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723098854] [2025-03-09 06:37:50,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:50,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:50,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:50,759 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:50,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 06:37:50,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:37:50,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:37:50,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:50,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:50,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:37:50,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:50,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723098854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:50,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:50,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-09 06:37:50,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657891642] [2025-03-09 06:37:50,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:50,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 06:37:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:50,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:37:50,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:37:51,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-09 06:37:51,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 216 transitions, 1662 flow. Second operand has 19 states, 19 states have (on average 44.26315789473684) internal successors, (841), 19 states have internal predecessors, (841), 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:37:51,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:51,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-09 06:37:51,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:52,921 INFO L124 PetriNetUnfolderBase]: 7221/17388 cut-off events. [2025-03-09 06:37:52,921 INFO L125 PetriNetUnfolderBase]: For 43732/44372 co-relation queries the response was YES. [2025-03-09 06:37:53,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50473 conditions, 17388 events. 7221/17388 cut-off events. For 43732/44372 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 182231 event pairs, 314 based on Foata normal form. 548/16650 useless extension candidates. Maximal degree in co-relation 50425. Up to 3115 conditions per place. [2025-03-09 06:37:53,058 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 335 selfloop transitions, 91 changer transitions 37/507 dead transitions. [2025-03-09 06:37:53,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 507 transitions, 4731 flow [2025-03-09 06:37:53,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 06:37:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 06:37:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 771 transitions. [2025-03-09 06:37:53,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6403654485049833 [2025-03-09 06:37:53,059 INFO L175 Difference]: Start difference. First operand has 197 places, 216 transitions, 1662 flow. Second operand 14 states and 771 transitions. [2025-03-09 06:37:53,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 507 transitions, 4731 flow [2025-03-09 06:37:53,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 507 transitions, 4639 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:37:53,222 INFO L231 Difference]: Finished difference. Result has 208 places, 219 transitions, 1867 flow [2025-03-09 06:37:53,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1867, PETRI_PLACES=208, PETRI_TRANSITIONS=219} [2025-03-09 06:37:53,222 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 129 predicate places. [2025-03-09 06:37:53,222 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 219 transitions, 1867 flow [2025-03-09 06:37:53,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 44.26315789473684) internal successors, (841), 19 states have internal predecessors, (841), 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:37:53,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:53,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:53,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 06:37:53,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 06:37:53,423 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:53,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1798475179, now seen corresponding path program 1 times [2025-03-09 06:37:53,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:53,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-03-09 06:37:53,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:53,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:37:53,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:37:53,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:53,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:53,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:53,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-03-09 06:37:53,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372130691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:53,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874191593] [2025-03-09 06:37:53,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:53,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:53,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:53,559 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:53,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 06:37:53,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:37:53,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:37:53,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:53,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:53,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:37:53,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:53,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:37:53,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 06:37:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:53,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:53,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-09 06:37:53,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-09 06:37:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:53,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874191593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:53,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:53,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-09 06:37:53,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004865933] [2025-03-09 06:37:53,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:53,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 06:37:53,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:53,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 06:37:53,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:37:53,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 86 [2025-03-09 06:37:53,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 219 transitions, 1867 flow. Second operand has 15 states, 15 states have (on average 41.46666666666667) internal successors, (622), 15 states have internal predecessors, (622), 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:37:53,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:53,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 86 [2025-03-09 06:37:53,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:55,788 INFO L124 PetriNetUnfolderBase]: 11151/21096 cut-off events. [2025-03-09 06:37:55,788 INFO L125 PetriNetUnfolderBase]: For 57975/59001 co-relation queries the response was YES. [2025-03-09 06:37:55,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67215 conditions, 21096 events. 11151/21096 cut-off events. For 57975/59001 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 189303 event pairs, 2357 based on Foata normal form. 778/21104 useless extension candidates. Maximal degree in co-relation 67166. Up to 4949 conditions per place. [2025-03-09 06:37:55,931 INFO L140 encePairwiseOnDemand]: 68/86 looper letters, 397 selfloop transitions, 65 changer transitions 0/496 dead transitions. [2025-03-09 06:37:55,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 496 transitions, 4735 flow [2025-03-09 06:37:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 06:37:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 06:37:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 735 transitions. [2025-03-09 06:37:55,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2025-03-09 06:37:55,933 INFO L175 Difference]: Start difference. First operand has 208 places, 219 transitions, 1867 flow. Second operand 14 states and 735 transitions. [2025-03-09 06:37:55,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 496 transitions, 4735 flow [2025-03-09 06:37:56,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 496 transitions, 4696 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-09 06:37:56,071 INFO L231 Difference]: Finished difference. Result has 222 places, 223 transitions, 2039 flow [2025-03-09 06:37:56,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2039, PETRI_PLACES=222, PETRI_TRANSITIONS=223} [2025-03-09 06:37:56,071 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 143 predicate places. [2025-03-09 06:37:56,071 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 223 transitions, 2039 flow [2025-03-09 06:37:56,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 41.46666666666667) internal successors, (622), 15 states have internal predecessors, (622), 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:37:56,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:56,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:56,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 06:37:56,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:56,272 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:56,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash 81844971, now seen corresponding path program 1 times [2025-03-09 06:37:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:56,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749902893] [2025-03-09 06:37:56,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:56,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 06:37:56,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 06:37:56,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:56,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:56,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:56,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749902893] [2025-03-09 06:37:56,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749902893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:56,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470295681] [2025-03-09 06:37:56,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:56,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:56,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:56,408 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:56,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 06:37:56,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 06:37:56,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 06:37:56,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:56,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:56,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:37:56,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:56,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:37:56,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:37:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:56,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:56,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-09 06:37:56,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-09 06:37:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:37:56,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470295681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:56,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:56,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-09 06:37:56,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185805662] [2025-03-09 06:37:56,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:56,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 06:37:56,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:56,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 06:37:56,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-09 06:37:56,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 86 [2025-03-09 06:37:56,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 223 transitions, 2039 flow. Second operand has 16 states, 16 states have (on average 42.3125) internal successors, (677), 16 states have internal predecessors, (677), 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:37:56,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:56,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 86 [2025-03-09 06:37:56,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:58,925 INFO L124 PetriNetUnfolderBase]: 10841/20880 cut-off events. [2025-03-09 06:37:58,925 INFO L125 PetriNetUnfolderBase]: For 67283/68273 co-relation queries the response was YES. [2025-03-09 06:37:59,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71740 conditions, 20880 events. 10841/20880 cut-off events. For 67283/68273 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 190562 event pairs, 2492 based on Foata normal form. 1230/21522 useless extension candidates. Maximal degree in co-relation 71684. Up to 5198 conditions per place. [2025-03-09 06:37:59,079 INFO L140 encePairwiseOnDemand]: 67/86 looper letters, 423 selfloop transitions, 66 changer transitions 3/530 dead transitions. [2025-03-09 06:37:59,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 530 transitions, 5218 flow [2025-03-09 06:37:59,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 06:37:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 06:37:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 795 transitions. [2025-03-09 06:37:59,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6162790697674418 [2025-03-09 06:37:59,080 INFO L175 Difference]: Start difference. First operand has 222 places, 223 transitions, 2039 flow. Second operand 15 states and 795 transitions. [2025-03-09 06:37:59,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 530 transitions, 5218 flow [2025-03-09 06:37:59,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 530 transitions, 5123 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-03-09 06:37:59,297 INFO L231 Difference]: Finished difference. Result has 234 places, 231 transitions, 2176 flow [2025-03-09 06:37:59,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2176, PETRI_PLACES=234, PETRI_TRANSITIONS=231} [2025-03-09 06:37:59,298 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 155 predicate places. [2025-03-09 06:37:59,298 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 231 transitions, 2176 flow [2025-03-09 06:37:59,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 42.3125) internal successors, (677), 16 states have internal predecessors, (677), 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:37:59,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:59,298 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:59,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 06:37:59,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 06:37:59,499 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:37:59,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:59,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2023303311, now seen corresponding path program 1 times [2025-03-09 06:37:59,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:59,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690194587] [2025-03-09 06:37:59,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:59,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:59,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:37:59,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:37:59,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:59,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 06:37:59,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:59,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690194587] [2025-03-09 06:37:59,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690194587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:37:59,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694516115] [2025-03-09 06:37:59,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:59,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:37:59,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:37:59,573 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:37:59,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 06:37:59,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:37:59,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:37:59,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:59,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:59,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:37:59,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:37:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 06:37:59,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:37:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 06:37:59,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694516115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:37:59,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:37:59,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-09 06:37:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934224374] [2025-03-09 06:37:59,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:37:59,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 06:37:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:59,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 06:37:59,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-09 06:37:59,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-09 06:37:59,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 231 transitions, 2176 flow. Second operand has 20 states, 20 states have (on average 43.75) internal successors, (875), 20 states have internal predecessors, (875), 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:37:59,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:59,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-09 06:37:59,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:01,563 INFO L124 PetriNetUnfolderBase]: 6901/16226 cut-off events. [2025-03-09 06:38:01,563 INFO L125 PetriNetUnfolderBase]: For 55478/55847 co-relation queries the response was YES. [2025-03-09 06:38:01,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57649 conditions, 16226 events. 6901/16226 cut-off events. For 55478/55847 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 165276 event pairs, 3747 based on Foata normal form. 287/16433 useless extension candidates. Maximal degree in co-relation 57589. Up to 7674 conditions per place. [2025-03-09 06:38:01,708 INFO L140 encePairwiseOnDemand]: 76/86 looper letters, 169 selfloop transitions, 86 changer transitions 42/346 dead transitions. [2025-03-09 06:38:01,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 346 transitions, 3728 flow [2025-03-09 06:38:01,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:38:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:38:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 540 transitions. [2025-03-09 06:38:01,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-03-09 06:38:01,710 INFO L175 Difference]: Start difference. First operand has 234 places, 231 transitions, 2176 flow. Second operand 10 states and 540 transitions. [2025-03-09 06:38:01,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 346 transitions, 3728 flow [2025-03-09 06:38:02,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 346 transitions, 3497 flow, removed 23 selfloop flow, removed 9 redundant places. [2025-03-09 06:38:02,021 INFO L231 Difference]: Finished difference. Result has 238 places, 235 transitions, 2289 flow [2025-03-09 06:38:02,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2289, PETRI_PLACES=238, PETRI_TRANSITIONS=235} [2025-03-09 06:38:02,021 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 159 predicate places. [2025-03-09 06:38:02,022 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 235 transitions, 2289 flow [2025-03-09 06:38:02,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 43.75) internal successors, (875), 20 states have internal predecessors, (875), 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:38:02,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:02,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:02,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-09 06:38:02,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:02,223 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:38:02,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:02,223 INFO L85 PathProgramCache]: Analyzing trace with hash -839083588, now seen corresponding path program 1 times [2025-03-09 06:38:02,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:02,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783115092] [2025-03-09 06:38:02,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:02,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:02,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:38:02,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:38:02,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:02,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:38:02,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:02,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783115092] [2025-03-09 06:38:02,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783115092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:02,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:02,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:38:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084028873] [2025-03-09 06:38:02,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:02,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:02,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:02,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:02,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-09 06:38:02,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 235 transitions, 2289 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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:38:02,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:02,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-09 06:38:02,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:03,781 INFO L124 PetriNetUnfolderBase]: 8590/17518 cut-off events. [2025-03-09 06:38:03,781 INFO L125 PetriNetUnfolderBase]: For 59880/60391 co-relation queries the response was YES. [2025-03-09 06:38:03,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62363 conditions, 17518 events. 8590/17518 cut-off events. For 59880/60391 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 162450 event pairs, 3577 based on Foata normal form. 725/18110 useless extension candidates. Maximal degree in co-relation 62303. Up to 7831 conditions per place. [2025-03-09 06:38:03,937 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 235 selfloop transitions, 12 changer transitions 22/310 dead transitions. [2025-03-09 06:38:03,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 310 transitions, 3493 flow [2025-03-09 06:38:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-09 06:38:03,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6947674418604651 [2025-03-09 06:38:03,938 INFO L175 Difference]: Start difference. First operand has 238 places, 235 transitions, 2289 flow. Second operand 4 states and 239 transitions. [2025-03-09 06:38:03,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 310 transitions, 3493 flow [2025-03-09 06:38:04,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 310 transitions, 3315 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-09 06:38:04,242 INFO L231 Difference]: Finished difference. Result has 230 places, 222 transitions, 1953 flow [2025-03-09 06:38:04,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=2091, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1953, PETRI_PLACES=230, PETRI_TRANSITIONS=222} [2025-03-09 06:38:04,242 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 151 predicate places. [2025-03-09 06:38:04,242 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 222 transitions, 1953 flow [2025-03-09 06:38:04,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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:38:04,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:04,243 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:04,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-09 06:38:04,243 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:38:04,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:04,243 INFO L85 PathProgramCache]: Analyzing trace with hash 66951598, now seen corresponding path program 1 times [2025-03-09 06:38:04,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:04,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946261679] [2025-03-09 06:38:04,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:04,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:04,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 06:38:04,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:38:04,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:04,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 06:38:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:04,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946261679] [2025-03-09 06:38:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946261679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:04,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62920185] [2025-03-09 06:38:04,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:04,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:04,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:04,282 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:38:04,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 06:38:04,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 06:38:04,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:38:04,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:04,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:04,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:38:04,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 06:38:04,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:38:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 06:38:04,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62920185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:38:04,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:38:04,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-03-09 06:38:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016962060] [2025-03-09 06:38:04,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:38:04,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 06:38:04,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:04,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:38:04,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:38:04,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-09 06:38:04,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 222 transitions, 1953 flow. Second operand has 19 states, 19 states have (on average 44.421052631578945) internal successors, (844), 19 states have internal predecessors, (844), 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:38:04,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:04,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-09 06:38:04,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:06,181 INFO L124 PetriNetUnfolderBase]: 5538/12670 cut-off events. [2025-03-09 06:38:06,181 INFO L125 PetriNetUnfolderBase]: For 40602/41198 co-relation queries the response was YES. [2025-03-09 06:38:06,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44483 conditions, 12670 events. 5538/12670 cut-off events. For 40602/41198 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 119492 event pairs, 1300 based on Foata normal form. 412/13072 useless extension candidates. Maximal degree in co-relation 44425. Up to 2637 conditions per place. [2025-03-09 06:38:06,265 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 237 selfloop transitions, 54 changer transitions 101/437 dead transitions. [2025-03-09 06:38:06,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 437 transitions, 4217 flow [2025-03-09 06:38:06,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 06:38:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 06:38:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 916 transitions. [2025-03-09 06:38:06,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6265389876880985 [2025-03-09 06:38:06,267 INFO L175 Difference]: Start difference. First operand has 230 places, 222 transitions, 1953 flow. Second operand 17 states and 916 transitions. [2025-03-09 06:38:06,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 437 transitions, 4217 flow [2025-03-09 06:38:06,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 437 transitions, 4123 flow, removed 36 selfloop flow, removed 6 redundant places. [2025-03-09 06:38:06,524 INFO L231 Difference]: Finished difference. Result has 235 places, 200 transitions, 1734 flow [2025-03-09 06:38:06,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1734, PETRI_PLACES=235, PETRI_TRANSITIONS=200} [2025-03-09 06:38:06,525 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 156 predicate places. [2025-03-09 06:38:06,525 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 200 transitions, 1734 flow [2025-03-09 06:38:06,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 44.421052631578945) internal successors, (844), 19 states have internal predecessors, (844), 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:38:06,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:06,525 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:06,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-09 06:38:06,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:06,726 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:38:06,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1525508570, now seen corresponding path program 2 times [2025-03-09 06:38:06,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:06,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912949354] [2025-03-09 06:38:06,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:38:06,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:06,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 06:38:06,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:38:06,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:38:06,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 06:38:06,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:06,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912949354] [2025-03-09 06:38:06,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912949354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:06,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927490027] [2025-03-09 06:38:06,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:38:06,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:06,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:06,773 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:38:06,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 06:38:06,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 06:38:06,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:38:06,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:38:06,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:06,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:38:06,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 06:38:06,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:38:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 06:38:06,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927490027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:38:06,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:38:06,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-09 06:38:06,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851035669] [2025-03-09 06:38:06,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:38:06,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:38:06,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:06,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:38:06,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:38:06,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-09 06:38:06,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 200 transitions, 1734 flow. Second operand has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 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:38:06,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:06,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-09 06:38:06,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:07,841 INFO L124 PetriNetUnfolderBase]: 4604/10790 cut-off events. [2025-03-09 06:38:07,841 INFO L125 PetriNetUnfolderBase]: For 31496/31970 co-relation queries the response was YES. [2025-03-09 06:38:07,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37576 conditions, 10790 events. 4604/10790 cut-off events. For 31496/31970 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 103158 event pairs, 1232 based on Foata normal form. 345/11080 useless extension candidates. Maximal degree in co-relation 37518. Up to 5874 conditions per place. [2025-03-09 06:38:07,928 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 215 selfloop transitions, 7 changer transitions 0/268 dead transitions. [2025-03-09 06:38:07,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 268 transitions, 2659 flow [2025-03-09 06:38:07,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:38:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:38:07,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2025-03-09 06:38:07,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2025-03-09 06:38:07,929 INFO L175 Difference]: Start difference. First operand has 235 places, 200 transitions, 1734 flow. Second operand 5 states and 280 transitions. [2025-03-09 06:38:07,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 268 transitions, 2659 flow [2025-03-09 06:38:08,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 268 transitions, 2555 flow, removed 12 selfloop flow, removed 14 redundant places. [2025-03-09 06:38:08,050 INFO L231 Difference]: Finished difference. Result has 216 places, 200 transitions, 1679 flow [2025-03-09 06:38:08,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1679, PETRI_PLACES=216, PETRI_TRANSITIONS=200} [2025-03-09 06:38:08,050 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 137 predicate places. [2025-03-09 06:38:08,051 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 200 transitions, 1679 flow [2025-03-09 06:38:08,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 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:38:08,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:08,051 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:08,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 06:38:08,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:08,251 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:38:08,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash -46091985, now seen corresponding path program 1 times [2025-03-09 06:38:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:08,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969830612] [2025-03-09 06:38:08,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:08,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:08,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 06:38:08,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:38:08,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:08,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:38:08,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:08,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969830612] [2025-03-09 06:38:08,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969830612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:08,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085670] [2025-03-09 06:38:08,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:08,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:08,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:08,516 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:38:08,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 06:38:08,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 06:38:08,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:38:08,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:08,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:08,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 06:38:08,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:08,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 06:38:08,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-09 06:38:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 06:38:08,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:38:08,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-09 06:38:08,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-09 06:38:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 06:38:08,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:38:08,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:38:08,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-09 06:38:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400878363] [2025-03-09 06:38:08,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:38:08,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 06:38:08,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:08,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 06:38:08,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2025-03-09 06:38:08,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 86 [2025-03-09 06:38:08,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 200 transitions, 1679 flow. Second operand has 26 states, 26 states have (on average 40.88461538461539) internal successors, (1063), 26 states have internal predecessors, (1063), 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:38:08,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:08,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 86 [2025-03-09 06:38:08,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:10,817 INFO L124 PetriNetUnfolderBase]: 7319/16241 cut-off events. [2025-03-09 06:38:10,817 INFO L125 PetriNetUnfolderBase]: For 47291/48382 co-relation queries the response was YES. [2025-03-09 06:38:10,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56290 conditions, 16241 events. 7319/16241 cut-off events. For 47291/48382 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 158573 event pairs, 1791 based on Foata normal form. 663/16813 useless extension candidates. Maximal degree in co-relation 56234. Up to 2826 conditions per place. [2025-03-09 06:38:10,960 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 387 selfloop transitions, 52 changer transitions 2/484 dead transitions. [2025-03-09 06:38:10,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 484 transitions, 4471 flow [2025-03-09 06:38:10,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 06:38:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 06:38:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 827 transitions. [2025-03-09 06:38:10,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6010174418604651 [2025-03-09 06:38:10,961 INFO L175 Difference]: Start difference. First operand has 216 places, 200 transitions, 1679 flow. Second operand 16 states and 827 transitions. [2025-03-09 06:38:10,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 484 transitions, 4471 flow [2025-03-09 06:38:11,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 484 transitions, 4458 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:38:11,182 INFO L231 Difference]: Finished difference. Result has 231 places, 208 transitions, 1877 flow [2025-03-09 06:38:11,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1670, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1877, PETRI_PLACES=231, PETRI_TRANSITIONS=208} [2025-03-09 06:38:11,182 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 152 predicate places. [2025-03-09 06:38:11,183 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 208 transitions, 1877 flow [2025-03-09 06:38:11,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 40.88461538461539) internal successors, (1063), 26 states have internal predecessors, (1063), 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:38:11,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:11,183 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:11,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-09 06:38:11,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:11,383 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:38:11,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:11,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1428881652, now seen corresponding path program 1 times [2025-03-09 06:38:11,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:11,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586046916] [2025-03-09 06:38:11,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:11,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:11,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 06:38:11,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 06:38:11,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:11,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:38:11,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586046916] [2025-03-09 06:38:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586046916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624666802] [2025-03-09 06:38:11,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:11,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:11,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:11,623 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:38:11,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 06:38:11,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 06:38:11,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 06:38:11,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:11,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:11,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:38:11,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:11,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 06:38:11,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-09 06:38:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 06:38:11,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:38:11,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-09 06:38:11,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-09 06:38:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 06:38:11,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624666802] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:38:11,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:38:11,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-09 06:38:11,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116298231] [2025-03-09 06:38:11,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:38:11,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 06:38:11,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:11,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 06:38:11,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-03-09 06:38:12,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 86 [2025-03-09 06:38:12,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 208 transitions, 1877 flow. Second operand has 26 states, 26 states have (on average 38.96153846153846) internal successors, (1013), 26 states have internal predecessors, (1013), 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:38:12,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:12,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 86 [2025-03-09 06:38:12,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:14,106 INFO L124 PetriNetUnfolderBase]: 7988/16584 cut-off events. [2025-03-09 06:38:14,106 INFO L125 PetriNetUnfolderBase]: For 59344/60754 co-relation queries the response was YES. [2025-03-09 06:38:14,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60026 conditions, 16584 events. 7988/16584 cut-off events. For 59344/60754 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 154865 event pairs, 1746 based on Foata normal form. 777/17292 useless extension candidates. Maximal degree in co-relation 59966. Up to 3496 conditions per place. [2025-03-09 06:38:14,224 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 360 selfloop transitions, 48 changer transitions 0/449 dead transitions. [2025-03-09 06:38:14,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 449 transitions, 4298 flow [2025-03-09 06:38:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 06:38:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 06:38:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 739 transitions. [2025-03-09 06:38:14,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5728682170542636 [2025-03-09 06:38:14,225 INFO L175 Difference]: Start difference. First operand has 231 places, 208 transitions, 1877 flow. Second operand 15 states and 739 transitions. [2025-03-09 06:38:14,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 449 transitions, 4298 flow [2025-03-09 06:38:14,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 449 transitions, 4249 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-03-09 06:38:14,403 INFO L231 Difference]: Finished difference. Result has 237 places, 208 transitions, 1937 flow [2025-03-09 06:38:14,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1937, PETRI_PLACES=237, PETRI_TRANSITIONS=208} [2025-03-09 06:38:14,403 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 158 predicate places. [2025-03-09 06:38:14,403 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 208 transitions, 1937 flow [2025-03-09 06:38:14,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 38.96153846153846) internal successors, (1013), 26 states have internal predecessors, (1013), 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:38:14,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:14,404 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:14,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-09 06:38:14,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-09 06:38:14,604 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:38:14,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:14,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1345658607, now seen corresponding path program 1 times [2025-03-09 06:38:14,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:14,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444401558] [2025-03-09 06:38:14,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:14,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:14,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:38:14,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:38:14,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:14,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:38:14,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:14,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444401558] [2025-03-09 06:38:14,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444401558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:14,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298574078] [2025-03-09 06:38:14,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:14,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:14,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:14,850 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:38:14,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-09 06:38:14,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:38:14,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:38:14,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:14,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:14,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 06:38:14,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:14,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:38:14,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 06:38:14,991 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:38:14,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:38:15,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-09 06:38:15,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-09 06:38:15,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-09 06:38:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:38:15,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:38:15,217 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_142| Int)) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_142| v_ArrVal_487) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_142|) 0)))) is different from false [2025-03-09 06:38:15,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:38:15,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-09 06:38:15,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:38:15,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2025-03-09 06:38:15,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 06:38:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-09 06:38:15,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298574078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:38:15,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:38:15,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-09 06:38:15,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528394140] [2025-03-09 06:38:15,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:38:15,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 06:38:15,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:15,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 06:38:15,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=829, Unknown=8, NotChecked=58, Total=992 [2025-03-09 06:38:15,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 86 [2025-03-09 06:38:15,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 208 transitions, 1937 flow. Second operand has 32 states, 32 states have (on average 29.375) internal successors, (940), 32 states have internal predecessors, (940), 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:38:15,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:15,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 86 [2025-03-09 06:38:15,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:18,832 INFO L124 PetriNetUnfolderBase]: 12177/21910 cut-off events. [2025-03-09 06:38:18,832 INFO L125 PetriNetUnfolderBase]: For 74536/76308 co-relation queries the response was YES. [2025-03-09 06:38:18,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81314 conditions, 21910 events. 12177/21910 cut-off events. For 74536/76308 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 186479 event pairs, 3065 based on Foata normal form. 1027/22821 useless extension candidates. Maximal degree in co-relation 81253. Up to 4650 conditions per place. [2025-03-09 06:38:18,982 INFO L140 encePairwiseOnDemand]: 68/86 looper letters, 554 selfloop transitions, 59 changer transitions 2/642 dead transitions. [2025-03-09 06:38:18,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 642 transitions, 6026 flow [2025-03-09 06:38:18,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 06:38:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-09 06:38:18,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 981 transitions. [2025-03-09 06:38:18,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45627906976744187 [2025-03-09 06:38:18,984 INFO L175 Difference]: Start difference. First operand has 237 places, 208 transitions, 1937 flow. Second operand 25 states and 981 transitions. [2025-03-09 06:38:18,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 642 transitions, 6026 flow [2025-03-09 06:38:19,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 642 transitions, 5928 flow, removed 2 selfloop flow, removed 11 redundant places. [2025-03-09 06:38:19,256 INFO L231 Difference]: Finished difference. Result has 255 places, 214 transitions, 2041 flow [2025-03-09 06:38:19,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2041, PETRI_PLACES=255, PETRI_TRANSITIONS=214} [2025-03-09 06:38:19,256 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 176 predicate places. [2025-03-09 06:38:19,256 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 214 transitions, 2041 flow [2025-03-09 06:38:19,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 29.375) internal successors, (940), 32 states have internal predecessors, (940), 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:38:19,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:19,257 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:19,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-09 06:38:19,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-09 06:38:19,457 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:38:19,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:19,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1227682462, now seen corresponding path program 1 times [2025-03-09 06:38:19,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:19,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429963816] [2025-03-09 06:38:19,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:19,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:19,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:38:19,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:38:19,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:19,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:38:19,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:19,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429963816] [2025-03-09 06:38:19,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429963816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:19,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039062390] [2025-03-09 06:38:19,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:19,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:19,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:19,699 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:38:19,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-09 06:38:19,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:38:19,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:38:19,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:19,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:19,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 06:38:19,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:19,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:38:19,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 06:38:19,829 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:38:19,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:38:19,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 06:38:19,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 06:38:19,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-09 06:38:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:38:19,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:38:20,044 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_144| Int)) (or (< (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_144| v_ArrVal_516) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_144|) 0)))) is different from false [2025-03-09 06:38:20,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:38:20,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-09 06:38:20,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:38:20,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2025-03-09 06:38:20,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:38:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-09 06:38:20,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039062390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:38:20,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:38:20,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2025-03-09 06:38:20,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041368720] [2025-03-09 06:38:20,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:38:20,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-09 06:38:20,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:20,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 06:38:20,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=771, Unknown=6, NotChecked=56, Total=930 [2025-03-09 06:38:20,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 86 [2025-03-09 06:38:20,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 214 transitions, 2041 flow. Second operand has 31 states, 31 states have (on average 31.64516129032258) internal successors, (981), 31 states have internal predecessors, (981), 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:38:20,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:20,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 86 [2025-03-09 06:38:20,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:23,213 INFO L124 PetriNetUnfolderBase]: 11891/20967 cut-off events. [2025-03-09 06:38:23,213 INFO L125 PetriNetUnfolderBase]: For 106857/108791 co-relation queries the response was YES. [2025-03-09 06:38:23,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82523 conditions, 20967 events. 11891/20967 cut-off events. For 106857/108791 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 172744 event pairs, 2237 based on Foata normal form. 1211/21869 useless extension candidates. Maximal degree in co-relation 82458. Up to 4541 conditions per place. [2025-03-09 06:38:23,369 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 453 selfloop transitions, 52 changer transitions 38/578 dead transitions. [2025-03-09 06:38:23,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 578 transitions, 6475 flow [2025-03-09 06:38:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 06:38:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 06:38:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 846 transitions. [2025-03-09 06:38:23,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4684385382059801 [2025-03-09 06:38:23,370 INFO L175 Difference]: Start difference. First operand has 255 places, 214 transitions, 2041 flow. Second operand 21 states and 846 transitions. [2025-03-09 06:38:23,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 578 transitions, 6475 flow [2025-03-09 06:38:23,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 578 transitions, 6168 flow, removed 31 selfloop flow, removed 15 redundant places. [2025-03-09 06:38:23,784 INFO L231 Difference]: Finished difference. Result has 263 places, 221 transitions, 2131 flow [2025-03-09 06:38:23,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2131, PETRI_PLACES=263, PETRI_TRANSITIONS=221} [2025-03-09 06:38:23,784 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 184 predicate places. [2025-03-09 06:38:23,784 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 221 transitions, 2131 flow [2025-03-09 06:38:23,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 31.64516129032258) internal successors, (981), 31 states have internal predecessors, (981), 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:38:23,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:23,785 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:23,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-09 06:38:23,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-09 06:38:23,985 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:38:23,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:23,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1234256783, now seen corresponding path program 1 times [2025-03-09 06:38:23,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:23,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138494489] [2025-03-09 06:38:23,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:23,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:23,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:38:23,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:38:23,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:23,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:24,202 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:38:24,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:24,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138494489] [2025-03-09 06:38:24,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138494489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:24,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267586894] [2025-03-09 06:38:24,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:24,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:24,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:24,205 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:38:24,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-09 06:38:24,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:38:24,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:38:24,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:24,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:24,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 06:38:24,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:24,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:38:24,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 06:38:24,330 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:38:24,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:38:24,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 06:38:24,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 06:38:24,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-09 06:38:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:38:24,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:38:24,527 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_544) c_~a1~0.base) (+ c_~a1~0.offset 4)) 2147483648)) is different from false [2025-03-09 06:38:24,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:38:24,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-09 06:38:24,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:38:24,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2025-03-09 06:38:24,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:38:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-09 06:38:24,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267586894] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:38:24,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:38:24,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2025-03-09 06:38:24,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437665250] [2025-03-09 06:38:24,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:38:24,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-09 06:38:24,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:24,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-09 06:38:24,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=894, Unknown=1, NotChecked=60, Total=1056 [2025-03-09 06:38:24,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 86 [2025-03-09 06:38:24,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 221 transitions, 2131 flow. Second operand has 33 states, 33 states have (on average 29.363636363636363) internal successors, (969), 33 states have internal predecessors, (969), 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:38:24,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:24,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 86 [2025-03-09 06:38:24,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:28,046 INFO L124 PetriNetUnfolderBase]: 12736/22658 cut-off events. [2025-03-09 06:38:28,046 INFO L125 PetriNetUnfolderBase]: For 96865/98951 co-relation queries the response was YES. [2025-03-09 06:38:28,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90149 conditions, 22658 events. 12736/22658 cut-off events. For 96865/98951 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 190946 event pairs, 3851 based on Foata normal form. 1220/23732 useless extension candidates. Maximal degree in co-relation 90081. Up to 5558 conditions per place. [2025-03-09 06:38:28,222 INFO L140 encePairwiseOnDemand]: 67/86 looper letters, 567 selfloop transitions, 56 changer transitions 104/757 dead transitions. [2025-03-09 06:38:28,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 757 transitions, 7982 flow [2025-03-09 06:38:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 06:38:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-09 06:38:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1018 transitions. [2025-03-09 06:38:28,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4552772808586762 [2025-03-09 06:38:28,223 INFO L175 Difference]: Start difference. First operand has 263 places, 221 transitions, 2131 flow. Second operand 26 states and 1018 transitions. [2025-03-09 06:38:28,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 757 transitions, 7982 flow [2025-03-09 06:38:28,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 757 transitions, 7775 flow, removed 15 selfloop flow, removed 16 redundant places. [2025-03-09 06:38:28,551 INFO L231 Difference]: Finished difference. Result has 276 places, 225 transitions, 2217 flow [2025-03-09 06:38:28,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=2054, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2217, PETRI_PLACES=276, PETRI_TRANSITIONS=225} [2025-03-09 06:38:28,552 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 197 predicate places. [2025-03-09 06:38:28,552 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 225 transitions, 2217 flow [2025-03-09 06:38:28,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 29.363636363636363) internal successors, (969), 33 states have internal predecessors, (969), 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:38:28,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:28,552 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:28,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-09 06:38:28,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:28,753 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:38:28,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:28,753 INFO L85 PathProgramCache]: Analyzing trace with hash -596579427, now seen corresponding path program 1 times [2025-03-09 06:38:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:28,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207864207] [2025-03-09 06:38:28,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:28,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:28,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:38:28,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:38:28,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:28,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:38:29,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207864207] [2025-03-09 06:38:29,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207864207] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790719300] [2025-03-09 06:38:29,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:29,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:29,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:29,221 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:38:29,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-09 06:38:29,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:38:29,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:38:29,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:29,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:29,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 06:38:29,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:29,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:38:29,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 06:38:29,375 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:38:29,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:38:29,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-09 06:38:29,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-09 06:38:29,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-09 06:38:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:38:29,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:38:29,630 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_572 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_572) c_~a1~0.base) (+ c_~a1~0.offset 4)) 4294967296))) is different from false [2025-03-09 06:38:29,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:38:29,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-09 06:38:29,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:38:29,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2025-03-09 06:38:29,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 06:38:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-09 06:38:29,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790719300] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:38:29,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:38:29,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2025-03-09 06:38:29,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471457751] [2025-03-09 06:38:29,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:38:29,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-09 06:38:29,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:29,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-09 06:38:29,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=906, Unknown=1, NotChecked=60, Total=1056 [2025-03-09 06:38:29,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 86 [2025-03-09 06:38:29,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 225 transitions, 2217 flow. Second operand has 33 states, 33 states have (on average 24.575757575757574) internal successors, (811), 33 states have internal predecessors, (811), 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:38:29,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:29,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 86 [2025-03-09 06:38:29,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:36,783 INFO L124 PetriNetUnfolderBase]: 25224/44223 cut-off events. [2025-03-09 06:38:36,783 INFO L125 PetriNetUnfolderBase]: For 248166/251444 co-relation queries the response was YES. [2025-03-09 06:38:37,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180319 conditions, 44223 events. 25224/44223 cut-off events. For 248166/251444 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 393030 event pairs, 5910 based on Foata normal form. 2162/45713 useless extension candidates. Maximal degree in co-relation 180248. Up to 6808 conditions per place. [2025-03-09 06:38:37,133 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 865 selfloop transitions, 76 changer transitions 52/1027 dead transitions. [2025-03-09 06:38:37,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 1027 transitions, 11709 flow [2025-03-09 06:38:37,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-09 06:38:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-03-09 06:38:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 1295 transitions. [2025-03-09 06:38:37,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3861061419200954 [2025-03-09 06:38:37,135 INFO L175 Difference]: Start difference. First operand has 276 places, 225 transitions, 2217 flow. Second operand 39 states and 1295 transitions. [2025-03-09 06:38:37,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 1027 transitions, 11709 flow [2025-03-09 06:38:39,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 1027 transitions, 11023 flow, removed 35 selfloop flow, removed 21 redundant places. [2025-03-09 06:38:39,048 INFO L231 Difference]: Finished difference. Result has 295 places, 251 transitions, 2711 flow [2025-03-09 06:38:39,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=2711, PETRI_PLACES=295, PETRI_TRANSITIONS=251} [2025-03-09 06:38:39,048 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 216 predicate places. [2025-03-09 06:38:39,048 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 251 transitions, 2711 flow [2025-03-09 06:38:39,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 24.575757575757574) internal successors, (811), 33 states have internal predecessors, (811), 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:38:39,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:39,049 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:39,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-09 06:38:39,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-09 06:38:39,249 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:38:39,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash 343339976, now seen corresponding path program 2 times [2025-03-09 06:38:39,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:39,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823264693] [2025-03-09 06:38:39,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:38:39,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:39,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-09 06:38:39,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:38:39,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:38:39,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 06:38:39,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:39,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823264693] [2025-03-09 06:38:39,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823264693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:39,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560617554] [2025-03-09 06:38:39,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:38:39,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:39,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:39,375 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:38:39,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-09 06:38:39,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-09 06:38:39,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:38:39,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:38:39,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:39,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:38:39,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 06:38:39,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:38:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 06:38:39,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560617554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:38:39,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:38:39,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-03-09 06:38:39,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145585933] [2025-03-09 06:38:39,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:38:39,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 06:38:39,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:39,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 06:38:39,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2025-03-09 06:38:39,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-09 06:38:39,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 251 transitions, 2711 flow. Second operand has 28 states, 28 states have (on average 43.464285714285715) internal successors, (1217), 28 states have internal predecessors, (1217), 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:38:39,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:39,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-09 06:38:39,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:44,103 INFO L124 PetriNetUnfolderBase]: 11673/26448 cut-off events. [2025-03-09 06:38:44,103 INFO L125 PetriNetUnfolderBase]: For 128967/130454 co-relation queries the response was YES. [2025-03-09 06:38:44,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104481 conditions, 26448 events. 11673/26448 cut-off events. For 128967/130454 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 280382 event pairs, 5352 based on Foata normal form. 961/27294 useless extension candidates. Maximal degree in co-relation 104409. Up to 10572 conditions per place. [2025-03-09 06:38:44,310 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 279 selfloop transitions, 111 changer transitions 86/532 dead transitions. [2025-03-09 06:38:44,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 532 transitions, 6114 flow [2025-03-09 06:38:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 06:38:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-09 06:38:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1141 transitions. [2025-03-09 06:38:44,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.576845298281092 [2025-03-09 06:38:44,312 INFO L175 Difference]: Start difference. First operand has 295 places, 251 transitions, 2711 flow. Second operand 23 states and 1141 transitions. [2025-03-09 06:38:44,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 532 transitions, 6114 flow [2025-03-09 06:38:44,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 532 transitions, 5871 flow, removed 2 selfloop flow, removed 20 redundant places. [2025-03-09 06:38:44,912 INFO L231 Difference]: Finished difference. Result has 303 places, 277 transitions, 3111 flow [2025-03-09 06:38:44,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=2550, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3111, PETRI_PLACES=303, PETRI_TRANSITIONS=277} [2025-03-09 06:38:44,912 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 224 predicate places. [2025-03-09 06:38:44,912 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 277 transitions, 3111 flow [2025-03-09 06:38:44,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 43.464285714285715) internal successors, (1217), 28 states have internal predecessors, (1217), 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:38:44,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:44,913 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:44,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-09 06:38:45,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-09 06:38:45,113 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-09 06:38:45,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1314093376, now seen corresponding path program 1 times [2025-03-09 06:38:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:45,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549350737] [2025-03-09 06:38:45,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:45,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:45,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:38:45,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:38:45,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:45,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:38:45,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:45,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549350737] [2025-03-09 06:38:45,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549350737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:38:45,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365254704] [2025-03-09 06:38:45,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:45,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:38:45,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:45,461 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:38:45,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-09 06:38:45,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:38:45,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:38:45,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:45,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:45,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 06:38:45,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:38:45,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 06:38:45,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-09 06:38:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 06:38:45,712 INFO L312 TraceCheckSpWp]: Computing backward predicates...