./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:51:28,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:51:28,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:51:28,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:51:28,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:51:28,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:51:28,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:51:28,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:51:28,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:51:28,730 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:51:28,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:51:28,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:51:28,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:51:28,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:51:28,732 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:51:28,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:51:28,733 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:51:28,733 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:51:28,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:51:28,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:51:28,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:51:28,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:51:28,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:51:28,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:51:28,734 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:51:28,734 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:51:28,734 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:51:28,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:51:28,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:51:28,734 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:51:28,735 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:51:28,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:51:28,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:51:28,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:51:28,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:51:28,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:51:28,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:51:28,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:51:28,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:51:28,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:51:28,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:51:28,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:51:28,736 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:51:28,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:51:28,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:51:28,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:51:28,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:51:28,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:51:28,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:51:28,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:51:28,736 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-jdk21/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 -> faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 [2025-01-10 06:51:29,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:51:29,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:51:29,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:51:29,042 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:51:29,042 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:51:29,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-01-10 06:51:30,354 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4518047b1/2d4c7683c0464fa2b45d2bd9212a6a91/FLAG19049333a [2025-01-10 06:51:30,615 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:51:30,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-01-10 06:51:30,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4518047b1/2d4c7683c0464fa2b45d2bd9212a6a91/FLAG19049333a [2025-01-10 06:51:30,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4518047b1/2d4c7683c0464fa2b45d2bd9212a6a91 [2025-01-10 06:51:30,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:51:30,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:51:30,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:51:30,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:51:30,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:51:30,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:51:30" (1/1) ... [2025-01-10 06:51:30,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41f9ca31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:30, skipping insertion in model container [2025-01-10 06:51:30,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:51:30" (1/1) ... [2025-01-10 06:51:30,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:51:31,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:51:31,117 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:51:31,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:51:31,159 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:51:31,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31 WrapperNode [2025-01-10 06:51:31,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:51:31,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:51:31,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:51:31,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:51:31,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (1/1) ... [2025-01-10 06:51:31,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (1/1) ... [2025-01-10 06:51:31,214 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 388 [2025-01-10 06:51:31,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:51:31,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:51:31,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:51:31,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:51:31,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (1/1) ... [2025-01-10 06:51:31,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (1/1) ... [2025-01-10 06:51:31,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (1/1) ... [2025-01-10 06:51:31,246 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 06:51:31,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (1/1) ... [2025-01-10 06:51:31,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (1/1) ... [2025-01-10 06:51:31,261 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (1/1) ... [2025-01-10 06:51:31,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (1/1) ... [2025-01-10 06:51:31,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (1/1) ... [2025-01-10 06:51:31,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (1/1) ... [2025-01-10 06:51:31,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (1/1) ... [2025-01-10 06:51:31,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:51:31,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:51:31,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:51:31,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:51:31,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (1/1) ... [2025-01-10 06:51:31,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:51:31,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:31,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:51:31,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:51:31,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:51:31,335 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:51:31,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:51:31,335 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:51:31,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:51:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:51:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:51:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:51:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:51:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:51:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:51:31,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:51:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:51:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:51:31,337 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:51:31,436 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:51:31,437 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:51:32,138 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:51:32,139 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:51:32,492 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:51:32,492 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:51:32,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:51:32 BoogieIcfgContainer [2025-01-10 06:51:32,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:51:32,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:51:32,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:51:32,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:51:32,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:51:30" (1/3) ... [2025-01-10 06:51:32,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44625881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:51:32, skipping insertion in model container [2025-01-10 06:51:32,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:31" (2/3) ... [2025-01-10 06:51:32,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44625881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:51:32, skipping insertion in model container [2025-01-10 06:51:32,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:51:32" (3/3) ... [2025-01-10 06:51:32,502 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-01-10 06:51:32,517 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:51:32,519 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-1.wvr.c that has 3 procedures, 160 locations, 1 initial locations, 3 loop locations, and 54 error locations. [2025-01-10 06:51:32,519 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:51:32,619 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:51:32,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 180 transitions, 374 flow [2025-01-10 06:51:32,740 INFO L124 PetriNetUnfolderBase]: 21/178 cut-off events. [2025-01-10 06:51:32,742 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:51:32,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 178 events. 21/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 834 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 169. Up to 2 conditions per place. [2025-01-10 06:51:32,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 180 transitions, 374 flow [2025-01-10 06:51:32,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 176 transitions, 361 flow [2025-01-10 06:51:32,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:51:32,787 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;@51d887d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:51:32,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 108 error locations. [2025-01-10 06:51:32,792 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:51:32,792 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:51:32,792 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:51:32,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:32,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:51:32,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-01-10 06:51:32,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:32,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1223833, now seen corresponding path program 1 times [2025-01-10 06:51:32,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:32,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374108497] [2025-01-10 06:51:32,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:32,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:32,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:51:32,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:51:32,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:32,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:33,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:33,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374108497] [2025-01-10 06:51:33,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374108497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:33,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:33,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:33,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381709480] [2025-01-10 06:51:33,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:33,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:33,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:33,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:33,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:33,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 180 [2025-01-10 06:51:33,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 176 transitions, 361 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 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-01-10 06:51:33,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:33,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 180 [2025-01-10 06:51:33,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:34,010 INFO L124 PetriNetUnfolderBase]: 2273/5775 cut-off events. [2025-01-10 06:51:34,010 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-01-10 06:51:34,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9099 conditions, 5775 events. 2273/5775 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 53341 event pairs, 1252 based on Foata normal form. 1/4381 useless extension candidates. Maximal degree in co-relation 8938. Up to 3254 conditions per place. [2025-01-10 06:51:34,061 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 60 selfloop transitions, 4 changer transitions 0/179 dead transitions. [2025-01-10 06:51:34,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 179 transitions, 495 flow [2025-01-10 06:51:34,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2025-01-10 06:51:34,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7416666666666667 [2025-01-10 06:51:34,077 INFO L175 Difference]: Start difference. First operand has 162 places, 176 transitions, 361 flow. Second operand 4 states and 534 transitions. [2025-01-10 06:51:34,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 179 transitions, 495 flow [2025-01-10 06:51:34,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 179 transitions, 490 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:34,091 INFO L231 Difference]: Finished difference. Result has 164 places, 179 transitions, 385 flow [2025-01-10 06:51:34,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=385, PETRI_PLACES=164, PETRI_TRANSITIONS=179} [2025-01-10 06:51:34,101 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 2 predicate places. [2025-01-10 06:51:34,101 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 179 transitions, 385 flow [2025-01-10 06:51:34,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 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-01-10 06:51:34,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:34,102 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:51:34,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:51:34,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-01-10 06:51:34,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:34,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2100670343, now seen corresponding path program 1 times [2025-01-10 06:51:34,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:34,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562038079] [2025-01-10 06:51:34,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:34,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:34,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:51:34,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:51:34,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:34,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:34,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:34,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562038079] [2025-01-10 06:51:34,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562038079] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:34,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877512680] [2025-01-10 06:51:34,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:34,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:34,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:34,286 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:51:34,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:51:34,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:51:34,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:51:34,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:34,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:34,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:51:34,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:34,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:51:34,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877512680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:34,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:51:34,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:51:34,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349129544] [2025-01-10 06:51:34,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:34,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:34,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:34,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:34,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:51:34,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 180 [2025-01-10 06:51:34,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 179 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 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-01-10 06:51:34,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:34,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 180 [2025-01-10 06:51:34,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:35,266 INFO L124 PetriNetUnfolderBase]: 2273/5774 cut-off events. [2025-01-10 06:51:35,266 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 06:51:35,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9087 conditions, 5774 events. 2273/5774 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 53369 event pairs, 1252 based on Foata normal form. 1/4381 useless extension candidates. Maximal degree in co-relation 9060. Up to 3249 conditions per place. [2025-01-10 06:51:35,313 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 56 selfloop transitions, 7 changer transitions 0/178 dead transitions. [2025-01-10 06:51:35,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 178 transitions, 507 flow [2025-01-10 06:51:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:51:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:51:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2025-01-10 06:51:35,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7092592592592593 [2025-01-10 06:51:35,317 INFO L175 Difference]: Start difference. First operand has 164 places, 179 transitions, 385 flow. Second operand 6 states and 766 transitions. [2025-01-10 06:51:35,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 178 transitions, 507 flow [2025-01-10 06:51:35,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 178 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:35,323 INFO L231 Difference]: Finished difference. Result has 167 places, 178 transitions, 392 flow [2025-01-10 06:51:35,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=392, PETRI_PLACES=167, PETRI_TRANSITIONS=178} [2025-01-10 06:51:35,324 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 5 predicate places. [2025-01-10 06:51:35,324 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 178 transitions, 392 flow [2025-01-10 06:51:35,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 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-01-10 06:51:35,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:35,325 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:51:35,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:51:35,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:35,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-01-10 06:51:35,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:35,531 INFO L85 PathProgramCache]: Analyzing trace with hash 696272397, now seen corresponding path program 1 times [2025-01-10 06:51:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:35,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188926002] [2025-01-10 06:51:35,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:35,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:35,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:51:35,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:51:35,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:35,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:35,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:35,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188926002] [2025-01-10 06:51:35,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188926002] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:35,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955243215] [2025-01-10 06:51:35,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:35,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:35,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:35,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:51:35,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:51:35,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:51:35,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:51:35,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:35,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:35,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:51:35,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:35,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:35,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955243215] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:35,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:35,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 06:51:35,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506696240] [2025-01-10 06:51:35,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:35,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:51:35,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:35,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:51:35,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:51:35,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 180 [2025-01-10 06:51:35,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 178 transitions, 392 flow. Second operand has 12 states, 12 states have (on average 118.08333333333333) internal successors, (1417), 12 states have internal predecessors, (1417), 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-01-10 06:51:35,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:35,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 180 [2025-01-10 06:51:35,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:36,495 INFO L124 PetriNetUnfolderBase]: 2276/5786 cut-off events. [2025-01-10 06:51:36,496 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 06:51:36,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9131 conditions, 5786 events. 2276/5786 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 53503 event pairs, 1252 based on Foata normal form. 3/4393 useless extension candidates. Maximal degree in co-relation 9061. Up to 3256 conditions per place. [2025-01-10 06:51:36,537 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 59 selfloop transitions, 13 changer transitions 0/187 dead transitions. [2025-01-10 06:51:36,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 187 transitions, 590 flow [2025-01-10 06:51:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:51:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:51:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1245 transitions. [2025-01-10 06:51:36,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2025-01-10 06:51:36,544 INFO L175 Difference]: Start difference. First operand has 167 places, 178 transitions, 392 flow. Second operand 10 states and 1245 transitions. [2025-01-10 06:51:36,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 187 transitions, 590 flow [2025-01-10 06:51:36,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 187 transitions, 544 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-01-10 06:51:36,551 INFO L231 Difference]: Finished difference. Result has 174 places, 187 transitions, 444 flow [2025-01-10 06:51:36,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=444, PETRI_PLACES=174, PETRI_TRANSITIONS=187} [2025-01-10 06:51:36,554 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 12 predicate places. [2025-01-10 06:51:36,554 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 187 transitions, 444 flow [2025-01-10 06:51:36,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 118.08333333333333) internal successors, (1417), 12 states have internal predecessors, (1417), 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-01-10 06:51:36,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:36,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:36,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:51:36,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:36,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-01-10 06:51:36,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash 931209048, now seen corresponding path program 1 times [2025-01-10 06:51:36,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:36,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929127646] [2025-01-10 06:51:36,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:36,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:36,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:51:36,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:51:36,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:36,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:36,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:36,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929127646] [2025-01-10 06:51:36,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929127646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:36,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:36,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:36,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631724082] [2025-01-10 06:51:36,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:36,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:36,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:36,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:36,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:36,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 180 [2025-01-10 06:51:36,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 187 transitions, 444 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 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-01-10 06:51:36,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:36,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 180 [2025-01-10 06:51:36,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:37,995 INFO L124 PetriNetUnfolderBase]: 5324/11288 cut-off events. [2025-01-10 06:51:37,996 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-10 06:51:38,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19267 conditions, 11288 events. 5324/11288 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 104407 event pairs, 1055 based on Foata normal form. 416/9325 useless extension candidates. Maximal degree in co-relation 19233. Up to 3742 conditions per place. [2025-01-10 06:51:38,076 INFO L140 encePairwiseOnDemand]: 148/180 looper letters, 143 selfloop transitions, 20 changer transitions 0/255 dead transitions. [2025-01-10 06:51:38,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 255 transitions, 910 flow [2025-01-10 06:51:38,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2025-01-10 06:51:38,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7541666666666667 [2025-01-10 06:51:38,081 INFO L175 Difference]: Start difference. First operand has 174 places, 187 transitions, 444 flow. Second operand 4 states and 543 transitions. [2025-01-10 06:51:38,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 255 transitions, 910 flow [2025-01-10 06:51:38,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 255 transitions, 899 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:38,090 INFO L231 Difference]: Finished difference. Result has 174 places, 195 transitions, 569 flow [2025-01-10 06:51:38,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=569, PETRI_PLACES=174, PETRI_TRANSITIONS=195} [2025-01-10 06:51:38,091 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 12 predicate places. [2025-01-10 06:51:38,093 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 195 transitions, 569 flow [2025-01-10 06:51:38,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 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-01-10 06:51:38,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:38,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:38,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:51:38,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-01-10 06:51:38,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:38,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1197289198, now seen corresponding path program 1 times [2025-01-10 06:51:38,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:38,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765427345] [2025-01-10 06:51:38,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:38,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:38,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:51:38,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:51:38,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:38,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:38,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:38,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765427345] [2025-01-10 06:51:38,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765427345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:38,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:38,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:38,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739242325] [2025-01-10 06:51:38,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:38,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:38,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:38,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:38,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:38,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 180 [2025-01-10 06:51:38,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 195 transitions, 569 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 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-01-10 06:51:38,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:38,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 180 [2025-01-10 06:51:38,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:40,188 INFO L124 PetriNetUnfolderBase]: 9422/21135 cut-off events. [2025-01-10 06:51:40,188 INFO L125 PetriNetUnfolderBase]: For 5958/6051 co-relation queries the response was YES. [2025-01-10 06:51:40,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40920 conditions, 21135 events. 9422/21135 cut-off events. For 5958/6051 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 208927 event pairs, 1337 based on Foata normal form. 301/18096 useless extension candidates. Maximal degree in co-relation 40884. Up to 6364 conditions per place. [2025-01-10 06:51:40,332 INFO L140 encePairwiseOnDemand]: 161/180 looper letters, 203 selfloop transitions, 31 changer transitions 0/334 dead transitions. [2025-01-10 06:51:40,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 334 transitions, 1426 flow [2025-01-10 06:51:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 719 transitions. [2025-01-10 06:51:40,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7988888888888889 [2025-01-10 06:51:40,335 INFO L175 Difference]: Start difference. First operand has 174 places, 195 transitions, 569 flow. Second operand 5 states and 719 transitions. [2025-01-10 06:51:40,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 334 transitions, 1426 flow [2025-01-10 06:51:40,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 334 transitions, 1426 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:40,356 INFO L231 Difference]: Finished difference. Result has 182 places, 217 transitions, 831 flow [2025-01-10 06:51:40,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=831, PETRI_PLACES=182, PETRI_TRANSITIONS=217} [2025-01-10 06:51:40,358 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 20 predicate places. [2025-01-10 06:51:40,358 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 217 transitions, 831 flow [2025-01-10 06:51:40,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 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-01-10 06:51:40,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:40,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:40,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:51:40,359 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-01-10 06:51:40,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:40,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1197257388, now seen corresponding path program 1 times [2025-01-10 06:51:40,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:40,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129922637] [2025-01-10 06:51:40,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:40,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:40,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:51:40,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:51:40,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:40,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:40,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129922637] [2025-01-10 06:51:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129922637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:40,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:40,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:40,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838714737] [2025-01-10 06:51:40,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:40,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:40,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:40,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:40,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 180 [2025-01-10 06:51:40,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 217 transitions, 831 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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-01-10 06:51:40,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:40,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 180 [2025-01-10 06:51:40,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:42,018 INFO L124 PetriNetUnfolderBase]: 6858/18027 cut-off events. [2025-01-10 06:51:42,018 INFO L125 PetriNetUnfolderBase]: For 11937/12464 co-relation queries the response was YES. [2025-01-10 06:51:42,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35499 conditions, 18027 events. 6858/18027 cut-off events. For 11937/12464 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 189419 event pairs, 4205 based on Foata normal form. 273/14995 useless extension candidates. Maximal degree in co-relation 35457. Up to 7489 conditions per place. [2025-01-10 06:51:42,152 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 122 selfloop transitions, 5 changer transitions 0/247 dead transitions. [2025-01-10 06:51:42,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 247 transitions, 1156 flow [2025-01-10 06:51:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2025-01-10 06:51:42,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7902777777777777 [2025-01-10 06:51:42,155 INFO L175 Difference]: Start difference. First operand has 182 places, 217 transitions, 831 flow. Second operand 4 states and 569 transitions. [2025-01-10 06:51:42,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 247 transitions, 1156 flow [2025-01-10 06:51:42,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 247 transitions, 1148 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:42,213 INFO L231 Difference]: Finished difference. Result has 187 places, 218 transitions, 854 flow [2025-01-10 06:51:42,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=854, PETRI_PLACES=187, PETRI_TRANSITIONS=218} [2025-01-10 06:51:42,215 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 25 predicate places. [2025-01-10 06:51:42,216 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 218 transitions, 854 flow [2025-01-10 06:51:42,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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-01-10 06:51:42,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:42,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:42,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:51:42,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-01-10 06:51:42,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:42,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1053955041, now seen corresponding path program 1 times [2025-01-10 06:51:42,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:42,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886605928] [2025-01-10 06:51:42,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:42,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:42,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:51:42,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:51:42,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:42,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:42,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:42,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886605928] [2025-01-10 06:51:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886605928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:42,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:42,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371155529] [2025-01-10 06:51:42,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:42,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:42,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:42,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:42,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:42,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 180 [2025-01-10 06:51:42,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 218 transitions, 854 flow. Second operand has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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-01-10 06:51:42,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:42,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 180 [2025-01-10 06:51:42,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:44,677 INFO L124 PetriNetUnfolderBase]: 15194/33042 cut-off events. [2025-01-10 06:51:44,677 INFO L125 PetriNetUnfolderBase]: For 29824/31391 co-relation queries the response was YES. [2025-01-10 06:51:44,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72558 conditions, 33042 events. 15194/33042 cut-off events. For 29824/31391 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 340611 event pairs, 4101 based on Foata normal form. 1830/29651 useless extension candidates. Maximal degree in co-relation 72514. Up to 9920 conditions per place. [2025-01-10 06:51:44,877 INFO L140 encePairwiseOnDemand]: 148/180 looper letters, 222 selfloop transitions, 20 changer transitions 0/338 dead transitions. [2025-01-10 06:51:44,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 338 transitions, 2048 flow [2025-01-10 06:51:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2025-01-10 06:51:44,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7513888888888889 [2025-01-10 06:51:44,880 INFO L175 Difference]: Start difference. First operand has 187 places, 218 transitions, 854 flow. Second operand 4 states and 541 transitions. [2025-01-10 06:51:44,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 338 transitions, 2048 flow [2025-01-10 06:51:44,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 338 transitions, 2045 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:44,996 INFO L231 Difference]: Finished difference. Result has 188 places, 226 transitions, 987 flow [2025-01-10 06:51:44,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=987, PETRI_PLACES=188, PETRI_TRANSITIONS=226} [2025-01-10 06:51:44,997 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 26 predicate places. [2025-01-10 06:51:44,997 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 226 transitions, 987 flow [2025-01-10 06:51:44,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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-01-10 06:51:44,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:44,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:44,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:51:44,998 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-01-10 06:51:44,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:44,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1538710144, now seen corresponding path program 1 times [2025-01-10 06:51:44,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:44,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125250480] [2025-01-10 06:51:44,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:44,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:45,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:51:45,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:51:45,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:45,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125250480] [2025-01-10 06:51:45,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125250480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:45,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:45,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:45,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868645199] [2025-01-10 06:51:45,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:45,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:45,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:45,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:45,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:45,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 180 [2025-01-10 06:51:45,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 226 transitions, 987 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 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-01-10 06:51:45,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:45,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 180 [2025-01-10 06:51:45,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:47,669 INFO L124 PetriNetUnfolderBase]: 12097/28436 cut-off events. [2025-01-10 06:51:47,669 INFO L125 PetriNetUnfolderBase]: For 29869/31183 co-relation queries the response was YES. [2025-01-10 06:51:47,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67007 conditions, 28436 events. 12097/28436 cut-off events. For 29869/31183 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 301457 event pairs, 2267 based on Foata normal form. 880/25464 useless extension candidates. Maximal degree in co-relation 66960. Up to 8600 conditions per place. [2025-01-10 06:51:47,838 INFO L140 encePairwiseOnDemand]: 164/180 looper letters, 226 selfloop transitions, 33 changer transitions 0/359 dead transitions. [2025-01-10 06:51:47,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 359 transitions, 2042 flow [2025-01-10 06:51:47,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 703 transitions. [2025-01-10 06:51:47,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7811111111111111 [2025-01-10 06:51:47,840 INFO L175 Difference]: Start difference. First operand has 188 places, 226 transitions, 987 flow. Second operand 5 states and 703 transitions. [2025-01-10 06:51:47,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 359 transitions, 2042 flow [2025-01-10 06:51:47,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 359 transitions, 2042 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:47,954 INFO L231 Difference]: Finished difference. Result has 192 places, 230 transitions, 1065 flow [2025-01-10 06:51:47,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1065, PETRI_PLACES=192, PETRI_TRANSITIONS=230} [2025-01-10 06:51:47,955 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 30 predicate places. [2025-01-10 06:51:47,955 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 230 transitions, 1065 flow [2025-01-10 06:51:47,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 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-01-10 06:51:47,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:47,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:47,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:51:47,956 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-01-10 06:51:47,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:47,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1687133565, now seen corresponding path program 1 times [2025-01-10 06:51:47,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:47,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655643570] [2025-01-10 06:51:47,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:47,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:47,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:51:47,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:51:47,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:47,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:48,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:48,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655643570] [2025-01-10 06:51:48,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655643570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:48,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:48,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:48,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13031038] [2025-01-10 06:51:48,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:48,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:48,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:48,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:48,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:48,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 180 [2025-01-10 06:51:48,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 230 transitions, 1065 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 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-01-10 06:51:48,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:48,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 180 [2025-01-10 06:51:48,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:52,467 INFO L124 PetriNetUnfolderBase]: 25291/59940 cut-off events. [2025-01-10 06:51:52,467 INFO L125 PetriNetUnfolderBase]: For 75681/78411 co-relation queries the response was YES. [2025-01-10 06:51:52,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142914 conditions, 59940 events. 25291/59940 cut-off events. For 75681/78411 co-relation queries the response was YES. Maximal size of possible extension queue 1588. Compared 688776 event pairs, 3922 based on Foata normal form. 2213/54478 useless extension candidates. Maximal degree in co-relation 142865. Up to 16606 conditions per place. [2025-01-10 06:51:52,899 INFO L140 encePairwiseOnDemand]: 161/180 looper letters, 307 selfloop transitions, 31 changer transitions 0/446 dead transitions. [2025-01-10 06:51:52,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 446 transitions, 3042 flow [2025-01-10 06:51:52,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2025-01-10 06:51:52,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7944444444444444 [2025-01-10 06:51:52,901 INFO L175 Difference]: Start difference. First operand has 192 places, 230 transitions, 1065 flow. Second operand 5 states and 715 transitions. [2025-01-10 06:51:52,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 446 transitions, 3042 flow [2025-01-10 06:51:53,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 446 transitions, 3042 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:53,099 INFO L231 Difference]: Finished difference. Result has 200 places, 252 transitions, 1327 flow [2025-01-10 06:51:53,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1327, PETRI_PLACES=200, PETRI_TRANSITIONS=252} [2025-01-10 06:51:53,100 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 38 predicate places. [2025-01-10 06:51:53,100 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 252 transitions, 1327 flow [2025-01-10 06:51:53,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 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-01-10 06:51:53,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:53,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:53,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:51:53,101 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-01-10 06:51:53,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:53,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1687165375, now seen corresponding path program 1 times [2025-01-10 06:51:53,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:53,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914225606] [2025-01-10 06:51:53,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:53,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:53,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:51:53,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:51:53,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:53,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:53,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:53,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914225606] [2025-01-10 06:51:53,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914225606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:53,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:53,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:53,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536744353] [2025-01-10 06:51:53,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:53,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:53,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:53,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:53,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:53,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 180 [2025-01-10 06:51:53,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 252 transitions, 1327 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 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-01-10 06:51:53,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:53,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 180 [2025-01-10 06:51:53,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:57,822 INFO L124 PetriNetUnfolderBase]: 20052/51945 cut-off events. [2025-01-10 06:51:57,823 INFO L125 PetriNetUnfolderBase]: For 81047/83342 co-relation queries the response was YES. [2025-01-10 06:51:58,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128387 conditions, 51945 events. 20052/51945 cut-off events. For 81047/83342 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 618203 event pairs, 12112 based on Foata normal form. 1317/46633 useless extension candidates. Maximal degree in co-relation 128332. Up to 21999 conditions per place. [2025-01-10 06:51:58,300 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 176 selfloop transitions, 5 changer transitions 0/309 dead transitions. [2025-01-10 06:51:58,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 309 transitions, 2057 flow [2025-01-10 06:51:58,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2025-01-10 06:51:58,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2025-01-10 06:51:58,302 INFO L175 Difference]: Start difference. First operand has 200 places, 252 transitions, 1327 flow. Second operand 4 states and 570 transitions. [2025-01-10 06:51:58,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 309 transitions, 2057 flow [2025-01-10 06:51:58,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 309 transitions, 2049 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:58,688 INFO L231 Difference]: Finished difference. Result has 205 places, 253 transitions, 1350 flow [2025-01-10 06:51:58,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1350, PETRI_PLACES=205, PETRI_TRANSITIONS=253} [2025-01-10 06:51:58,689 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 43 predicate places. [2025-01-10 06:51:58,689 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 253 transitions, 1350 flow [2025-01-10 06:51:58,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 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-01-10 06:51:58,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:58,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:58,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:51:58,690 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-01-10 06:51:58,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash 455374583, now seen corresponding path program 1 times [2025-01-10 06:51:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:58,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043982083] [2025-01-10 06:51:58,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:58,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:58,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:51:58,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:51:58,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:58,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:58,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:58,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043982083] [2025-01-10 06:51:58,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043982083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:58,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:58,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:51:58,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767839167] [2025-01-10 06:51:58,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:58,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:58,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:58,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:58,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:58,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 180 [2025-01-10 06:51:58,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 253 transitions, 1350 flow. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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-01-10 06:51:58,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:58,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 180 [2025-01-10 06:51:58,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:09,099 INFO L124 PetriNetUnfolderBase]: 51821/109233 cut-off events. [2025-01-10 06:52:09,100 INFO L125 PetriNetUnfolderBase]: For 167616/174662 co-relation queries the response was YES. [2025-01-10 06:52:09,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287990 conditions, 109233 events. 51821/109233 cut-off events. For 167616/174662 co-relation queries the response was YES. Maximal size of possible extension queue 2699. Compared 1251727 event pairs, 14638 based on Foata normal form. 3813/106770 useless extension candidates. Maximal degree in co-relation 287933. Up to 29284 conditions per place. [2025-01-10 06:52:10,061 INFO L140 encePairwiseOnDemand]: 159/180 looper letters, 428 selfloop transitions, 44 changer transitions 0/584 dead transitions. [2025-01-10 06:52:10,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 584 transitions, 4263 flow [2025-01-10 06:52:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:52:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:52:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 988 transitions. [2025-01-10 06:52:10,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7841269841269841 [2025-01-10 06:52:10,064 INFO L175 Difference]: Start difference. First operand has 205 places, 253 transitions, 1350 flow. Second operand 7 states and 988 transitions. [2025-01-10 06:52:10,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 584 transitions, 4263 flow [2025-01-10 06:52:10,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 584 transitions, 4260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:52:10,831 INFO L231 Difference]: Finished difference. Result has 214 places, 277 transitions, 1651 flow [2025-01-10 06:52:10,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1651, PETRI_PLACES=214, PETRI_TRANSITIONS=277} [2025-01-10 06:52:10,832 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 52 predicate places. [2025-01-10 06:52:10,832 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 277 transitions, 1651 flow [2025-01-10 06:52:10,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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-01-10 06:52:10,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:10,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:10,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:52:10,833 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-01-10 06:52:10,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:10,833 INFO L85 PathProgramCache]: Analyzing trace with hash -114102490, now seen corresponding path program 1 times [2025-01-10 06:52:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:10,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299735851] [2025-01-10 06:52:10,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:10,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:10,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:52:10,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:52:10,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:10,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:11,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:11,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299735851] [2025-01-10 06:52:11,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299735851] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:52:11,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792870310] [2025-01-10 06:52:11,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:11,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:11,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:11,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:52:11,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:52:11,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:52:11,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:52:11,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:11,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:11,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 06:52:11,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:52:11,251 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-01-10 06:52:11,311 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-01-10 06:52:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:11,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:52:11,391 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-01-10 06:52:11,401 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-01-10 06:52:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:11,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792870310] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:52:11,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:52:11,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 06:52:11,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585894344] [2025-01-10 06:52:11,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:52:11,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:52:11,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:11,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:52:11,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:52:11,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 180 [2025-01-10 06:52:11,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 277 transitions, 1651 flow. Second operand has 10 states, 10 states have (on average 108.5) internal successors, (1085), 10 states have internal predecessors, (1085), 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-01-10 06:52:11,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:11,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 180 [2025-01-10 06:52:11,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand