./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i --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/goblint-regression/28-race_reach_78-equ_racing.i -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 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:47:37,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:47:37,597 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:47:37,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:47:37,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:47:37,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:47:37,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:47:37,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:47:37,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:47:37,633 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:47:37,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:47:37,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:47:37,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:47:37,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:47:37,633 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:47:37,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:47:37,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:47:37,633 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:47:37,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:47:37,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:47:37,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:47:37,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:47:37,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:47:37,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:47:37,634 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:47:37,634 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:47:37,634 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:47:37,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:47:37,634 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:47:37,635 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:47:37,635 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:47:37,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:47:37,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:47:37,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:47:37,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:47:37,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:47:37,639 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 -> 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 [2025-01-10 06:47:38,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:47:38,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:47:38,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:47:38,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:47:38,044 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:47:38,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2025-01-10 06:47:39,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab913b7f9/c9bd9f31254e4144853d610528d49510/FLAG9716bdea1 [2025-01-10 06:47:39,667 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:47:39,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2025-01-10 06:47:39,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab913b7f9/c9bd9f31254e4144853d610528d49510/FLAG9716bdea1 [2025-01-10 06:47:39,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab913b7f9/c9bd9f31254e4144853d610528d49510 [2025-01-10 06:47:39,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:47:39,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:47:39,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:47:39,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:47:39,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:47:39,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:47:39" (1/1) ... [2025-01-10 06:47:39,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb82eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:39, skipping insertion in model container [2025-01-10 06:47:39,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:47:39" (1/1) ... [2025-01-10 06:47:39,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:47:40,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:47:40,309 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:47:40,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:47:40,424 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:47:40,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:40 WrapperNode [2025-01-10 06:47:40,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:47:40,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:47:40,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:47:40,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:47:40,432 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:47:40" (1/1) ... [2025-01-10 06:47:40,448 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:47:40" (1/1) ... [2025-01-10 06:47:40,477 INFO L138 Inliner]: procedures = 272, calls = 65, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 230 [2025-01-10 06:47:40,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:47:40,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:47:40,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:47:40,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:47:40,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:40" (1/1) ... [2025-01-10 06:47:40,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:40" (1/1) ... [2025-01-10 06:47:40,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:40" (1/1) ... [2025-01-10 06:47:40,511 INFO L175 MemorySlicer]: Split 35 memory accesses to 4 slices as follows [2, 5, 26, 2]. 74 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 5, 16, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-01-10 06:47:40,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:40" (1/1) ... [2025-01-10 06:47:40,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:40" (1/1) ... [2025-01-10 06:47:40,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:40" (1/1) ... [2025-01-10 06:47:40,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:40" (1/1) ... [2025-01-10 06:47:40,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:40" (1/1) ... [2025-01-10 06:47:40,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:40" (1/1) ... [2025-01-10 06:47:40,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:40" (1/1) ... [2025-01-10 06:47:40,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:47:40,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:47:40,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:47:40,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:47:40,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:40" (1/1) ... [2025-01-10 06:47:40,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:47:40,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:47:40,576 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:47:40,585 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:47:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:47:40,605 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:47:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:47:40,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:47:40,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:47:40,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:47:40,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:47:40,607 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:47:40,737 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:47:40,739 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:47:41,055 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:47:41,055 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:47:41,258 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:47:41,259 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-10 06:47:41,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:47:41 BoogieIcfgContainer [2025-01-10 06:47:41,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:47:41,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:47:41,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:47:41,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:47:41,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:47:39" (1/3) ... [2025-01-10 06:47:41,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22399e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:47:41, skipping insertion in model container [2025-01-10 06:47:41,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:40" (2/3) ... [2025-01-10 06:47:41,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22399e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:47:41, skipping insertion in model container [2025-01-10 06:47:41,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:47:41" (3/3) ... [2025-01-10 06:47:41,266 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing.i [2025-01-10 06:47:41,276 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:47:41,278 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_78-equ_racing.i that has 2 procedures, 94 locations, 1 initial locations, 12 loop locations, and 16 error locations. [2025-01-10 06:47:41,278 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:47:41,319 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:47:41,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 119 transitions, 245 flow [2025-01-10 06:47:41,415 INFO L124 PetriNetUnfolderBase]: 36/167 cut-off events. [2025-01-10 06:47:41,417 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:47:41,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 167 events. 36/167 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 614 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 97. Up to 8 conditions per place. [2025-01-10 06:47:41,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 119 transitions, 245 flow [2025-01-10 06:47:41,428 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 117 transitions, 241 flow [2025-01-10 06:47:41,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:47:41,442 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;@504c7dba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:47:41,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 06:47:41,451 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:47:41,452 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 06:47:41,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:47:41,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:41,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:47:41,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:47:41,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:41,458 INFO L85 PathProgramCache]: Analyzing trace with hash 19836087, now seen corresponding path program 1 times [2025-01-10 06:47:41,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686064676] [2025-01-10 06:47:41,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:41,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:41,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:47:41,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:47:41,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:41,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:41,671 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:47:41,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:41,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686064676] [2025-01-10 06:47:41,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686064676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:41,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:41,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:41,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458303939] [2025-01-10 06:47:41,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:41,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:41,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:41,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:41,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:41,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 119 [2025-01-10 06:47:41,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 117 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 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:47:41,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:41,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 119 [2025-01-10 06:47:41,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:42,169 INFO L124 PetriNetUnfolderBase]: 869/2697 cut-off events. [2025-01-10 06:47:42,170 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:47:42,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4429 conditions, 2697 events. 869/2697 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 21774 event pairs, 748 based on Foata normal form. 534/2908 useless extension candidates. Maximal degree in co-relation 2148. Up to 888 conditions per place. [2025-01-10 06:47:42,189 INFO L140 encePairwiseOnDemand]: 93/119 looper letters, 88 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2025-01-10 06:47:42,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 139 transitions, 477 flow [2025-01-10 06:47:42,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2025-01-10 06:47:42,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6680672268907563 [2025-01-10 06:47:42,200 INFO L175 Difference]: Start difference. First operand has 97 places, 117 transitions, 241 flow. Second operand 4 states and 318 transitions. [2025-01-10 06:47:42,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 139 transitions, 477 flow [2025-01-10 06:47:42,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 139 transitions, 477 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:47:42,205 INFO L231 Difference]: Finished difference. Result has 100 places, 97 transitions, 218 flow [2025-01-10 06:47:42,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=100, PETRI_TRANSITIONS=97} [2025-01-10 06:47:42,213 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places. [2025-01-10 06:47:42,213 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 97 transitions, 218 flow [2025-01-10 06:47:42,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 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:47:42,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:42,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:47:42,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:47:42,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:47:42,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:42,214 INFO L85 PathProgramCache]: Analyzing trace with hash 19836076, now seen corresponding path program 1 times [2025-01-10 06:47:42,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:42,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003139205] [2025-01-10 06:47:42,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:42,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:42,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:47:42,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:47:42,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:42,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:42,267 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:47:42,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:42,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003139205] [2025-01-10 06:47:42,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003139205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:42,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:42,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:42,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800971579] [2025-01-10 06:47:42,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:42,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:47:42,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:42,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:47:42,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:47:42,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 119 [2025-01-10 06:47:42,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 97 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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:47:42,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:42,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 119 [2025-01-10 06:47:42,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:42,593 INFO L124 PetriNetUnfolderBase]: 869/2703 cut-off events. [2025-01-10 06:47:42,594 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 06:47:42,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4500 conditions, 2703 events. 869/2703 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 21826 event pairs, 765 based on Foata normal form. 1/2382 useless extension candidates. Maximal degree in co-relation 2248. Up to 1722 conditions per place. [2025-01-10 06:47:42,608 INFO L140 encePairwiseOnDemand]: 116/119 looper letters, 49 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-01-10 06:47:42,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 318 flow [2025-01-10 06:47:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:47:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:47:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-01-10 06:47:42,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2025-01-10 06:47:42,611 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 218 flow. Second operand 3 states and 189 transitions. [2025-01-10 06:47:42,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 318 flow [2025-01-10 06:47:42,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 96 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:47:42,614 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 215 flow [2025-01-10 06:47:42,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=99, PETRI_TRANSITIONS=96} [2025-01-10 06:47:42,615 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 2 predicate places. [2025-01-10 06:47:42,615 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 215 flow [2025-01-10 06:47:42,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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:47:42,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:42,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:47:42,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:47:42,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:47:42,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:42,616 INFO L85 PathProgramCache]: Analyzing trace with hash 614918992, now seen corresponding path program 1 times [2025-01-10 06:47:42,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:42,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249723203] [2025-01-10 06:47:42,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:42,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:47:42,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:47:42,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:42,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:42,692 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:47:42,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:42,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249723203] [2025-01-10 06:47:42,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249723203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:42,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:42,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:42,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877293204] [2025-01-10 06:47:42,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:42,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:47:42,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:42,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:47:42,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:47:42,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 119 [2025-01-10 06:47:42,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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:47:42,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:42,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 119 [2025-01-10 06:47:42,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:42,997 INFO L124 PetriNetUnfolderBase]: 869/2702 cut-off events. [2025-01-10 06:47:42,997 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 06:47:43,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4479 conditions, 2702 events. 869/2702 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 21827 event pairs, 765 based on Foata normal form. 1/2381 useless extension candidates. Maximal degree in co-relation 2261. Up to 1722 conditions per place. [2025-01-10 06:47:43,012 INFO L140 encePairwiseOnDemand]: 116/119 looper letters, 48 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2025-01-10 06:47:43,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 313 flow [2025-01-10 06:47:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:47:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:47:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2025-01-10 06:47:43,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266106442577031 [2025-01-10 06:47:43,015 INFO L175 Difference]: Start difference. First operand has 99 places, 96 transitions, 215 flow. Second operand 3 states and 188 transitions. [2025-01-10 06:47:43,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 313 flow [2025-01-10 06:47:43,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:47:43,017 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 213 flow [2025-01-10 06:47:43,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2025-01-10 06:47:43,018 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2025-01-10 06:47:43,018 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 213 flow [2025-01-10 06:47:43,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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:47:43,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:43,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:47:43,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:47:43,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:47:43,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:43,020 INFO L85 PathProgramCache]: Analyzing trace with hash 614919402, now seen corresponding path program 1 times [2025-01-10 06:47:43,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:43,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547842260] [2025-01-10 06:47:43,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:43,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:43,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:47:43,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:47:43,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:43,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:43,133 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:47:43,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:43,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547842260] [2025-01-10 06:47:43,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547842260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:43,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:43,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:43,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026416423] [2025-01-10 06:47:43,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:43,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:47:43,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:43,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:47:43,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:47:43,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 119 [2025-01-10 06:47:43,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 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:47:43,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:43,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 119 [2025-01-10 06:47:43,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:43,667 INFO L124 PetriNetUnfolderBase]: 869/2694 cut-off events. [2025-01-10 06:47:43,668 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 06:47:43,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4471 conditions, 2694 events. 869/2694 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 21748 event pairs, 748 based on Foata normal form. 1/2374 useless extension candidates. Maximal degree in co-relation 2253. Up to 1663 conditions per place. [2025-01-10 06:47:43,676 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 52 selfloop transitions, 7 changer transitions 8/111 dead transitions. [2025-01-10 06:47:43,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 111 transitions, 379 flow [2025-01-10 06:47:43,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:47:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:47:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 297 transitions. [2025-01-10 06:47:43,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4991596638655462 [2025-01-10 06:47:43,678 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 213 flow. Second operand 5 states and 297 transitions. [2025-01-10 06:47:43,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 111 transitions, 379 flow [2025-01-10 06:47:43,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 111 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:47:43,680 INFO L231 Difference]: Finished difference. Result has 99 places, 94 transitions, 221 flow [2025-01-10 06:47:43,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=99, PETRI_TRANSITIONS=94} [2025-01-10 06:47:43,681 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 2 predicate places. [2025-01-10 06:47:43,681 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 94 transitions, 221 flow [2025-01-10 06:47:43,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 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:47:43,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:43,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:43,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:47:43,681 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:47:43,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:43,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1032852793, now seen corresponding path program 1 times [2025-01-10 06:47:43,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:43,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216977319] [2025-01-10 06:47:43,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:43,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:43,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:47:43,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:47:43,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:43,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:43,761 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:47:43,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:43,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216977319] [2025-01-10 06:47:43,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216977319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:43,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:43,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:43,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323991325] [2025-01-10 06:47:43,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:43,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:43,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:43,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:43,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:43,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 119 [2025-01-10 06:47:43,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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:47:43,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:43,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 119 [2025-01-10 06:47:43,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:44,010 INFO L124 PetriNetUnfolderBase]: 855/2371 cut-off events. [2025-01-10 06:47:44,013 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-10 06:47:44,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4178 conditions, 2371 events. 855/2371 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 18351 event pairs, 86 based on Foata normal form. 36/2174 useless extension candidates. Maximal degree in co-relation 2061. Up to 1606 conditions per place. [2025-01-10 06:47:44,021 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 83 selfloop transitions, 3 changer transitions 0/127 dead transitions. [2025-01-10 06:47:44,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 127 transitions, 459 flow [2025-01-10 06:47:44,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2025-01-10 06:47:44,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5630252100840336 [2025-01-10 06:47:44,023 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 221 flow. Second operand 4 states and 268 transitions. [2025-01-10 06:47:44,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 127 transitions, 459 flow [2025-01-10 06:47:44,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 127 transitions, 445 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:47:44,025 INFO L231 Difference]: Finished difference. Result has 97 places, 92 transitions, 213 flow [2025-01-10 06:47:44,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=97, PETRI_TRANSITIONS=92} [2025-01-10 06:47:44,029 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places. [2025-01-10 06:47:44,029 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 92 transitions, 213 flow [2025-01-10 06:47:44,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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:47:44,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:44,029 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:44,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:47:44,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:47:44,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:44,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1400502390, now seen corresponding path program 1 times [2025-01-10 06:47:44,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:44,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448790756] [2025-01-10 06:47:44,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:44,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:44,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:47:44,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:47:44,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:44,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:44,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:47:44,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:47:44,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:47:44,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:44,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:44,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:47:44,100 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:47:44,101 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-01-10 06:47:44,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2025-01-10 06:47:44,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2025-01-10 06:47:44,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2025-01-10 06:47:44,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2025-01-10 06:47:44,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2025-01-10 06:47:44,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2025-01-10 06:47:44,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2025-01-10 06:47:44,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2025-01-10 06:47:44,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2025-01-10 06:47:44,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2025-01-10 06:47:44,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2025-01-10 06:47:44,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2025-01-10 06:47:44,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2025-01-10 06:47:44,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2025-01-10 06:47:44,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2025-01-10 06:47:44,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2025-01-10 06:47:44,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2025-01-10 06:47:44,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2025-01-10 06:47:44,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2025-01-10 06:47:44,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2025-01-10 06:47:44,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:47:44,105 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-10 06:47:44,107 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:47:44,108 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:47:44,137 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:47:44,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 165 transitions, 346 flow [2025-01-10 06:47:44,153 INFO L124 PetriNetUnfolderBase]: 60/281 cut-off events. [2025-01-10 06:47:44,153 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:47:44,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 281 events. 60/281 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1241 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 169. Up to 12 conditions per place. [2025-01-10 06:47:44,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 165 transitions, 346 flow [2025-01-10 06:47:44,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 164 transitions, 344 flow [2025-01-10 06:47:44,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:47:44,157 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;@504c7dba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:47:44,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-01-10 06:47:44,158 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:47:44,158 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 06:47:44,158 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:47:44,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:44,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:47:44,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-01-10 06:47:44,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:44,159 INFO L85 PathProgramCache]: Analyzing trace with hash 24915447, now seen corresponding path program 1 times [2025-01-10 06:47:44,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:44,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484581227] [2025-01-10 06:47:44,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:44,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:44,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:47:44,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:47:44,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:44,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:44,190 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:47:44,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:44,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484581227] [2025-01-10 06:47:44,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484581227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:44,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:44,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:44,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803714287] [2025-01-10 06:47:44,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:44,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:44,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:44,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:44,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:44,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 165 [2025-01-10 06:47:44,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 164 transitions, 344 flow. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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:47:44,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:44,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 165 [2025-01-10 06:47:44,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:48,374 INFO L124 PetriNetUnfolderBase]: 31927/68045 cut-off events. [2025-01-10 06:47:48,375 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-01-10 06:47:48,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115780 conditions, 68045 events. 31927/68045 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 2040. Compared 762924 event pairs, 28458 based on Foata normal form. 15650/76272 useless extension candidates. Maximal degree in co-relation 50042. Up to 24466 conditions per place. [2025-01-10 06:47:48,862 INFO L140 encePairwiseOnDemand]: 129/165 looper letters, 128 selfloop transitions, 5 changer transitions 0/196 dead transitions. [2025-01-10 06:47:48,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 196 transitions, 688 flow [2025-01-10 06:47:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2025-01-10 06:47:48,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6757575757575758 [2025-01-10 06:47:48,864 INFO L175 Difference]: Start difference. First operand has 133 places, 164 transitions, 344 flow. Second operand 4 states and 446 transitions. [2025-01-10 06:47:48,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 196 transitions, 688 flow [2025-01-10 06:47:48,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 196 transitions, 688 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:47:48,869 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 301 flow [2025-01-10 06:47:48,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=136, PETRI_TRANSITIONS=134} [2025-01-10 06:47:48,871 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 3 predicate places. [2025-01-10 06:47:48,872 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 301 flow [2025-01-10 06:47:48,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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:47:48,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:48,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:47:48,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:47:48,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-01-10 06:47:48,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash 24915436, now seen corresponding path program 1 times [2025-01-10 06:47:48,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:48,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23380554] [2025-01-10 06:47:48,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:48,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:48,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:47:48,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:47:48,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:48,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:48,912 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:47:48,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:48,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23380554] [2025-01-10 06:47:48,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23380554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:48,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:48,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:48,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767691962] [2025-01-10 06:47:48,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:48,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:47:48,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:48,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:47:48,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:47:48,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 165 [2025-01-10 06:47:48,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 134 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:48,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:48,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 165 [2025-01-10 06:47:48,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:52,302 INFO L124 PetriNetUnfolderBase]: 31941/68321 cut-off events. [2025-01-10 06:47:52,302 INFO L125 PetriNetUnfolderBase]: For 650/650 co-relation queries the response was YES. [2025-01-10 06:47:52,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117161 conditions, 68321 events. 31941/68321 cut-off events. For 650/650 co-relation queries the response was YES. Maximal size of possible extension queue 2040. Compared 767834 event pairs, 29104 based on Foata normal form. 1/60783 useless extension candidates. Maximal degree in co-relation 59201. Up to 47556 conditions per place. [2025-01-10 06:47:52,618 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 69 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2025-01-10 06:47:52,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 133 transitions, 441 flow [2025-01-10 06:47:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:47:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:47:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2025-01-10 06:47:52,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2025-01-10 06:47:52,622 INFO L175 Difference]: Start difference. First operand has 136 places, 134 transitions, 301 flow. Second operand 3 states and 260 transitions. [2025-01-10 06:47:52,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 133 transitions, 441 flow [2025-01-10 06:47:52,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 133 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:47:52,628 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 298 flow [2025-01-10 06:47:52,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2025-01-10 06:47:52,629 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 2 predicate places. [2025-01-10 06:47:52,629 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 298 flow [2025-01-10 06:47:52,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:52,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:52,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:47:52,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:47:52,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-01-10 06:47:52,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:52,632 INFO L85 PathProgramCache]: Analyzing trace with hash 772379317, now seen corresponding path program 1 times [2025-01-10 06:47:52,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:52,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172122564] [2025-01-10 06:47:52,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:52,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:52,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:47:52,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:47:52,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:52,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:52,677 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:47:52,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:52,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172122564] [2025-01-10 06:47:52,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172122564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:52,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:52,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:52,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229021204] [2025-01-10 06:47:52,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:52,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:47:52,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:52,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:47:52,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:47:52,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 165 [2025-01-10 06:47:52,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:52,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:52,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 165 [2025-01-10 06:47:52,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:56,593 INFO L124 PetriNetUnfolderBase]: 31941/68320 cut-off events. [2025-01-10 06:47:56,593 INFO L125 PetriNetUnfolderBase]: For 650/650 co-relation queries the response was YES. [2025-01-10 06:47:56,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116798 conditions, 68320 events. 31941/68320 cut-off events. For 650/650 co-relation queries the response was YES. Maximal size of possible extension queue 2037. Compared 767802 event pairs, 29104 based on Foata normal form. 1/60784 useless extension candidates. Maximal degree in co-relation 59214. Up to 47556 conditions per place. [2025-01-10 06:47:57,105 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 68 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2025-01-10 06:47:57,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 132 transitions, 436 flow [2025-01-10 06:47:57,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:47:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:47:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2025-01-10 06:47:57,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5232323232323233 [2025-01-10 06:47:57,110 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 298 flow. Second operand 3 states and 259 transitions. [2025-01-10 06:47:57,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 132 transitions, 436 flow [2025-01-10 06:47:57,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 132 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:47:57,117 INFO L231 Difference]: Finished difference. Result has 134 places, 132 transitions, 296 flow [2025-01-10 06:47:57,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=134, PETRI_TRANSITIONS=132} [2025-01-10 06:47:57,122 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 1 predicate places. [2025-01-10 06:47:57,122 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 132 transitions, 296 flow [2025-01-10 06:47:57,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:57,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:57,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:47:57,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:47:57,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-01-10 06:47:57,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash 772379727, now seen corresponding path program 1 times [2025-01-10 06:47:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:57,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728651159] [2025-01-10 06:47:57,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:57,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:57,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:47:57,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:47:57,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:57,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:57,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:47:57,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:57,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728651159] [2025-01-10 06:47:57,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728651159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:57,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:57,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:57,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711722418] [2025-01-10 06:47:57,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:57,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:47:57,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:57,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:47:57,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:47:57,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 165 [2025-01-10 06:47:57,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 132 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 63.8) internal successors, (319), 5 states have internal predecessors, (319), 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:47:57,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:57,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 165 [2025-01-10 06:47:57,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:01,240 INFO L124 PetriNetUnfolderBase]: 31927/68042 cut-off events. [2025-01-10 06:48:01,240 INFO L125 PetriNetUnfolderBase]: For 650/650 co-relation queries the response was YES. [2025-01-10 06:48:01,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116506 conditions, 68042 events. 31927/68042 cut-off events. For 650/650 co-relation queries the response was YES. Maximal size of possible extension queue 2037. Compared 762865 event pairs, 28458 based on Foata normal form. 1/60567 useless extension candidates. Maximal degree in co-relation 58910. Up to 46147 conditions per place. [2025-01-10 06:48:01,667 INFO L140 encePairwiseOnDemand]: 158/165 looper letters, 97 selfloop transitions, 7 changer transitions 0/165 dead transitions. [2025-01-10 06:48:01,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 165 transitions, 570 flow [2025-01-10 06:48:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:48:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:48:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 419 transitions. [2025-01-10 06:48:01,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5078787878787879 [2025-01-10 06:48:01,673 INFO L175 Difference]: Start difference. First operand has 134 places, 132 transitions, 296 flow. Second operand 5 states and 419 transitions. [2025-01-10 06:48:01,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 165 transitions, 570 flow [2025-01-10 06:48:01,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 165 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:48:01,677 INFO L231 Difference]: Finished difference. Result has 135 places, 131 transitions, 304 flow [2025-01-10 06:48:01,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=135, PETRI_TRANSITIONS=131} [2025-01-10 06:48:01,679 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 2 predicate places. [2025-01-10 06:48:01,679 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 131 transitions, 304 flow [2025-01-10 06:48:01,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.8) internal successors, (319), 5 states have internal predecessors, (319), 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:48:01,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:01,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:01,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:48:01,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-01-10 06:48:01,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1260936481, now seen corresponding path program 1 times [2025-01-10 06:48:01,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:01,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588567637] [2025-01-10 06:48:01,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:01,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:01,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:48:01,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:48:01,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:01,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:01,735 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:48:01,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:01,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588567637] [2025-01-10 06:48:01,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588567637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:01,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:01,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:01,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216707411] [2025-01-10 06:48:01,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:01,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:48:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:01,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:48:01,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:48:01,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 165 [2025-01-10 06:48:01,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 131 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 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:48:01,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:01,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 165 [2025-01-10 06:48:01,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:06,119 INFO L124 PetriNetUnfolderBase]: 35861/76473 cut-off events. [2025-01-10 06:48:06,120 INFO L125 PetriNetUnfolderBase]: For 1428/1428 co-relation queries the response was YES. [2025-01-10 06:48:06,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131520 conditions, 76473 events. 35861/76473 cut-off events. For 1428/1428 co-relation queries the response was YES. Maximal size of possible extension queue 2141. Compared 869488 event pairs, 21753 based on Foata normal form. 36/68042 useless extension candidates. Maximal degree in co-relation 63520. Up to 53291 conditions per place. [2025-01-10 06:48:06,539 INFO L140 encePairwiseOnDemand]: 159/165 looper letters, 107 selfloop transitions, 3 changer transitions 0/168 dead transitions. [2025-01-10 06:48:06,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 168 transitions, 598 flow [2025-01-10 06:48:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:48:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:48:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 360 transitions. [2025-01-10 06:48:06,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-01-10 06:48:06,541 INFO L175 Difference]: Start difference. First operand has 135 places, 131 transitions, 304 flow. Second operand 4 states and 360 transitions. [2025-01-10 06:48:06,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 168 transitions, 598 flow [2025-01-10 06:48:06,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 168 transitions, 584 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:48:06,573 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 314 flow [2025-01-10 06:48:06,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2025-01-10 06:48:06,573 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 3 predicate places. [2025-01-10 06:48:06,573 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 314 flow [2025-01-10 06:48:06,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 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:48:06,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:06,574 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:06,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:48:06,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-01-10 06:48:06,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:06,574 INFO L85 PathProgramCache]: Analyzing trace with hash -696696221, now seen corresponding path program 1 times [2025-01-10 06:48:06,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:06,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935343566] [2025-01-10 06:48:06,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:06,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:06,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:48:06,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:48:06,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:06,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:06,678 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:48:06,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:06,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935343566] [2025-01-10 06:48:06,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935343566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:06,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:06,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:48:06,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698904685] [2025-01-10 06:48:06,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:06,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:48:06,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:06,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:48:06,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:48:06,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 165 [2025-01-10 06:48:06,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 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:48:06,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:06,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 165 [2025-01-10 06:48:06,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:10,873 INFO L124 PetriNetUnfolderBase]: 32781/63366 cut-off events. [2025-01-10 06:48:10,874 INFO L125 PetriNetUnfolderBase]: For 2164/2164 co-relation queries the response was YES. [2025-01-10 06:48:11,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116670 conditions, 63366 events. 32781/63366 cut-off events. For 2164/2164 co-relation queries the response was YES. Maximal size of possible extension queue 1872. Compared 666383 event pairs, 1224 based on Foata normal form. 648/58288 useless extension candidates. Maximal degree in co-relation 56593. Up to 40611 conditions per place. [2025-01-10 06:48:11,243 INFO L140 encePairwiseOnDemand]: 160/165 looper letters, 171 selfloop transitions, 6 changer transitions 0/235 dead transitions. [2025-01-10 06:48:11,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 235 transitions, 870 flow [2025-01-10 06:48:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:48:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:48:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 549 transitions. [2025-01-10 06:48:11,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5545454545454546 [2025-01-10 06:48:11,246 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 314 flow. Second operand 6 states and 549 transitions. [2025-01-10 06:48:11,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 235 transitions, 870 flow [2025-01-10 06:48:11,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 235 transitions, 868 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:48:11,261 INFO L231 Difference]: Finished difference. Result has 139 places, 132 transitions, 320 flow [2025-01-10 06:48:11,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=139, PETRI_TRANSITIONS=132} [2025-01-10 06:48:11,262 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 6 predicate places. [2025-01-10 06:48:11,262 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 132 transitions, 320 flow [2025-01-10 06:48:11,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 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:48:11,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:11,262 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:11,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:48:11,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-01-10 06:48:11,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:11,263 INFO L85 PathProgramCache]: Analyzing trace with hash -122745540, now seen corresponding path program 1 times [2025-01-10 06:48:11,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:11,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762176283] [2025-01-10 06:48:11,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:11,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:11,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:48:11,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:48:11,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:11,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:11,313 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:48:11,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:11,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762176283] [2025-01-10 06:48:11,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762176283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:11,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:11,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:11,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603518495] [2025-01-10 06:48:11,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:11,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:48:11,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:11,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:48:11,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:48:11,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 165 [2025-01-10 06:48:11,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 132 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 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:48:11,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:11,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 165 [2025-01-10 06:48:11,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:15,125 INFO L124 PetriNetUnfolderBase]: 31631/61268 cut-off events. [2025-01-10 06:48:15,126 INFO L125 PetriNetUnfolderBase]: For 5024/5024 co-relation queries the response was YES. [2025-01-10 06:48:15,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114142 conditions, 61268 events. 31631/61268 cut-off events. For 5024/5024 co-relation queries the response was YES. Maximal size of possible extension queue 1847. Compared 642699 event pairs, 1226 based on Foata normal form. 648/56872 useless extension candidates. Maximal degree in co-relation 55329. Up to 42553 conditions per place. [2025-01-10 06:48:15,424 INFO L140 encePairwiseOnDemand]: 160/165 looper letters, 136 selfloop transitions, 6 changer transitions 0/200 dead transitions. [2025-01-10 06:48:15,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 200 transitions, 738 flow [2025-01-10 06:48:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:48:15,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:48:15,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 388 transitions. [2025-01-10 06:48:15,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2025-01-10 06:48:15,427 INFO L175 Difference]: Start difference. First operand has 139 places, 132 transitions, 320 flow. Second operand 4 states and 388 transitions. [2025-01-10 06:48:15,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 200 transitions, 738 flow [2025-01-10 06:48:15,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 200 transitions, 722 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 06:48:15,439 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 320 flow [2025-01-10 06:48:15,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=320, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2025-01-10 06:48:15,440 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 4 predicate places. [2025-01-10 06:48:15,440 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 320 flow [2025-01-10 06:48:15,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 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:48:15,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:15,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:15,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:48:15,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-01-10 06:48:15,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:15,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1777280333, now seen corresponding path program 1 times [2025-01-10 06:48:15,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:15,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871202670] [2025-01-10 06:48:15,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:15,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:15,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:48:15,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:48:15,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:15,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:15,506 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:48:15,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:15,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871202670] [2025-01-10 06:48:15,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871202670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:15,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:15,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:48:15,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995600341] [2025-01-10 06:48:15,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:15,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:48:15,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:15,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:48:15,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:48:15,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 165 [2025-01-10 06:48:15,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 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:48:15,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:15,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 165 [2025-01-10 06:48:15,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand