./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:21:33,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:21:33,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:21:33,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:21:33,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:21:33,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:21:33,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:21:33,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:21:33,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:21:33,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:21:33,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:21:33,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:21:33,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:21:33,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:21:33,243 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:21:33,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:21:33,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:21:33,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:21:33,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:21:33,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:21:33,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:21:33,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:21:33,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:21:33,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:21:33,244 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:21:33,244 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:21:33,244 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:21:33,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:21:33,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:21:33,244 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:21:33,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:21:33,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:21:33,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:21:33,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:21:33,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:21:33,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:21:33,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:21:33,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:21:33,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:21:33,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:21:33,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:21:33,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:21:33,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:21:33,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:21:33,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:21:33,246 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df [2025-03-04 15:21:33,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:21:33,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:21:33,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:21:33,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:21:33,496 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:21:33,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2025-03-04 15:21:34,700 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97bffc058/554822ddb68d4704af07a4e8548e331c/FLAG1059d3992 [2025-03-04 15:21:34,977 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:21:34,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2025-03-04 15:21:34,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97bffc058/554822ddb68d4704af07a4e8548e331c/FLAG1059d3992 [2025-03-04 15:21:35,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97bffc058/554822ddb68d4704af07a4e8548e331c [2025-03-04 15:21:35,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:21:35,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:21:35,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:21:35,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:21:35,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:21:35,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dac9f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35, skipping insertion in model container [2025-03-04 15:21:35,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:21:35,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:21:35,574 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:21:35,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:21:35,649 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:21:35,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35 WrapperNode [2025-03-04 15:21:35,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:21:35,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:21:35,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:21:35,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:21:35,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,684 INFO L138 Inliner]: procedures = 171, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 86 [2025-03-04 15:21:35,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:21:35,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:21:35,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:21:35,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:21:35,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,707 INFO L175 MemorySlicer]: Split 25 memory accesses to 6 slices as follows [2, 5, 5, 5, 2, 6]. 24 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 5, 5, 0, 1]. The 3 writes are split as follows [0, 0, 0, 0, 1, 2]. [2025-03-04 15:21:35,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,712 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:21:35,716 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:21:35,716 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:21:35,716 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:21:35,717 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35" (1/1) ... [2025-03-04 15:21:35,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:21:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:21:35,751 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:21:35,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:21:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:21:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:21:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:21:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:21:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 15:21:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:21:35,774 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:21:35,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:21:35,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 15:21:35,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 15:21:35,775 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:21:35,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:21:35,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:21:35,776 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:21:35,889 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:21:35,891 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:21:36,059 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L708: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:21:36,060 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 15:21:36,096 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:21:36,096 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:21:36,212 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:21:36,212 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:21:36,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:21:36 BoogieIcfgContainer [2025-03-04 15:21:36,213 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:21:36,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:21:36,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:21:36,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:21:36,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:21:35" (1/3) ... [2025-03-04 15:21:36,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c01a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:21:36, skipping insertion in model container [2025-03-04 15:21:36,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:35" (2/3) ... [2025-03-04 15:21:36,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c01a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:21:36, skipping insertion in model container [2025-03-04 15:21:36,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:21:36" (3/3) ... [2025-03-04 15:21:36,221 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2025-03-04 15:21:36,232 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:21:36,233 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_11-ptr_racing.i that has 2 procedures, 50 locations, 1 initial locations, 5 loop locations, and 8 error locations. [2025-03-04 15:21:36,233 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:21:36,269 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:21:36,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 59 transitions, 125 flow [2025-03-04 15:21:36,342 INFO L124 PetriNetUnfolderBase]: 11/74 cut-off events. [2025-03-04 15:21:36,345 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:21:36,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 74 events. 11/74 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 221 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 50. Up to 4 conditions per place. [2025-03-04 15:21:36,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 59 transitions, 125 flow [2025-03-04 15:21:36,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 58 transitions, 123 flow [2025-03-04 15:21:36,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:36,366 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;@5ba243d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:36,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 15:21:36,370 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:36,370 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:21:36,370 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:36,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:36,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:36,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:21:36,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:36,375 INFO L85 PathProgramCache]: Analyzing trace with hash 318360438, now seen corresponding path program 1 times [2025-03-04 15:21:36,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:36,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831031184] [2025-03-04 15:21:36,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:36,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:36,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:36,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:36,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:36,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:36,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:36,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831031184] [2025-03-04 15:21:36,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831031184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:36,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:36,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:36,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964853387] [2025-03-04 15:21:36,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:36,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:36,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:36,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:36,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:36,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2025-03-04 15:21:36,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:36,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:36,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2025-03-04 15:21:36,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:36,853 INFO L124 PetriNetUnfolderBase]: 144/398 cut-off events. [2025-03-04 15:21:36,853 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:21:36,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 398 events. 144/398 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1879 event pairs, 0 based on Foata normal form. 65/430 useless extension candidates. Maximal degree in co-relation 689. Up to 277 conditions per place. [2025-03-04 15:21:36,856 INFO L140 encePairwiseOnDemand]: 45/59 looper letters, 49 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2025-03-04 15:21:36,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 257 flow [2025-03-04 15:21:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-03-04 15:21:36,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673728813559322 [2025-03-04 15:21:36,870 INFO L175 Difference]: Start difference. First operand has 53 places, 58 transitions, 123 flow. Second operand 4 states and 159 transitions. [2025-03-04 15:21:36,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 257 flow [2025-03-04 15:21:36,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 257 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:36,881 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 113 flow [2025-03-04 15:21:36,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-03-04 15:21:36,886 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-03-04 15:21:36,888 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 113 flow [2025-03-04 15:21:36,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:36,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:36,888 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:36,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:21:36,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:21:36,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash 988264631, now seen corresponding path program 1 times [2025-03-04 15:21:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:36,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243896771] [2025-03-04 15:21:36,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:36,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:36,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:21:36,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:21:36,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:36,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:36,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:21:36,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:21:36,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:21:36,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:36,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:36,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:21:36,959 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:21:36,961 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-04 15:21:36,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-04 15:21:36,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-04 15:21:36,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-04 15:21:36,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-04 15:21:36,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-04 15:21:36,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-04 15:21:36,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-04 15:21:36,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-04 15:21:36,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-04 15:21:36,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-04 15:21:36,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-04 15:21:36,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-04 15:21:36,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:21:36,964 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 15:21:36,966 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:21:36,966 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:21:36,989 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:21:36,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 91 transitions, 198 flow [2025-03-04 15:21:37,013 INFO L124 PetriNetUnfolderBase]: 21/140 cut-off events. [2025-03-04 15:21:37,013 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:21:37,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 140 events. 21/140 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 515 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 89. Up to 6 conditions per place. [2025-03-04 15:21:37,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 91 transitions, 198 flow [2025-03-04 15:21:37,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 91 transitions, 198 flow [2025-03-04 15:21:37,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:37,019 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;@5ba243d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:37,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-04 15:21:37,022 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:37,025 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 15:21:37,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:37,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:37,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:37,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:37,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash 405231023, now seen corresponding path program 1 times [2025-03-04 15:21:37,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:37,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559958300] [2025-03-04 15:21:37,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:37,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:37,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:37,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:37,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:37,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:37,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:37,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559958300] [2025-03-04 15:21:37,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559958300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:37,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:37,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:37,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557131524] [2025-03-04 15:21:37,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:37,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:37,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:37,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:37,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:37,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 91 [2025-03-04 15:21:37,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 91 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:37,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:37,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 91 [2025-03-04 15:21:37,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:38,065 INFO L124 PetriNetUnfolderBase]: 4742/9620 cut-off events. [2025-03-04 15:21:38,065 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-03-04 15:21:38,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17210 conditions, 9620 events. 4742/9620 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 76292 event pairs, 2644 based on Foata normal form. 1382/10058 useless extension candidates. Maximal degree in co-relation 3435. Up to 7478 conditions per place. [2025-03-04 15:21:38,129 INFO L140 encePairwiseOnDemand]: 71/91 looper letters, 68 selfloop transitions, 3 changer transitions 0/104 dead transitions. [2025-03-04 15:21:38,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 366 flow [2025-03-04 15:21:38,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2025-03-04 15:21:38,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6373626373626373 [2025-03-04 15:21:38,131 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 198 flow. Second operand 4 states and 232 transitions. [2025-03-04 15:21:38,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 366 flow [2025-03-04 15:21:38,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 104 transitions, 366 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:38,135 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 194 flow [2025-03-04 15:21:38,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2025-03-04 15:21:38,137 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 5 predicate places. [2025-03-04 15:21:38,137 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 194 flow [2025-03-04 15:21:38,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:38,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:38,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:38,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:21:38,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:38,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1611320438, now seen corresponding path program 1 times [2025-03-04 15:21:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864569839] [2025-03-04 15:21:38,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:38,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:38,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:21:38,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:21:38,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:38,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:38,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:38,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864569839] [2025-03-04 15:21:38,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864569839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:38,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:38,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:21:38,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356796116] [2025-03-04 15:21:38,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:38,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:21:38,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:38,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:21:38,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:21:38,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 91 [2025-03-04 15:21:38,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:38,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:38,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 91 [2025-03-04 15:21:38,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:39,406 INFO L124 PetriNetUnfolderBase]: 6470/13279 cut-off events. [2025-03-04 15:21:39,407 INFO L125 PetriNetUnfolderBase]: For 525/907 co-relation queries the response was YES. [2025-03-04 15:21:39,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24209 conditions, 13279 events. 6470/13279 cut-off events. For 525/907 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 114694 event pairs, 1227 based on Foata normal form. 283/12482 useless extension candidates. Maximal degree in co-relation 24103. Up to 6083 conditions per place. [2025-03-04 15:21:39,462 INFO L140 encePairwiseOnDemand]: 81/91 looper letters, 163 selfloop transitions, 17 changer transitions 0/215 dead transitions. [2025-03-04 15:21:39,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 215 transitions, 884 flow [2025-03-04 15:21:39,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:21:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:21:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 420 transitions. [2025-03-04 15:21:39,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6593406593406593 [2025-03-04 15:21:39,465 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 194 flow. Second operand 7 states and 420 transitions. [2025-03-04 15:21:39,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 215 transitions, 884 flow [2025-03-04 15:21:39,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 215 transitions, 879 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:21:39,472 INFO L231 Difference]: Finished difference. Result has 96 places, 96 transitions, 324 flow [2025-03-04 15:21:39,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=324, PETRI_PLACES=96, PETRI_TRANSITIONS=96} [2025-03-04 15:21:39,473 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 16 predicate places. [2025-03-04 15:21:39,473 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 324 flow [2025-03-04 15:21:39,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:39,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:39,473 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:39,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:21:39,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:39,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash 839322952, now seen corresponding path program 1 times [2025-03-04 15:21:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:39,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499049249] [2025-03-04 15:21:39,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:39,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:39,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:21:39,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:21:39,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:39,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:39,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:39,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499049249] [2025-03-04 15:21:39,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499049249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:39,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:39,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:21:39,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904379325] [2025-03-04 15:21:39,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:39,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:21:39,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:39,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:21:39,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:21:39,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 91 [2025-03-04 15:21:39,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:39,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:39,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 91 [2025-03-04 15:21:39,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:40,663 INFO L124 PetriNetUnfolderBase]: 6612/13118 cut-off events. [2025-03-04 15:21:40,663 INFO L125 PetriNetUnfolderBase]: For 4420/4420 co-relation queries the response was YES. [2025-03-04 15:21:40,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27910 conditions, 13118 events. 6612/13118 cut-off events. For 4420/4420 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 109528 event pairs, 1379 based on Foata normal form. 177/12392 useless extension candidates. Maximal degree in co-relation 27237. Up to 8145 conditions per place. [2025-03-04 15:21:40,742 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 145 selfloop transitions, 6 changer transitions 0/184 dead transitions. [2025-03-04 15:21:40,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 184 transitions, 912 flow [2025-03-04 15:21:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:21:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:21:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 317 transitions. [2025-03-04 15:21:40,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5805860805860806 [2025-03-04 15:21:40,744 INFO L175 Difference]: Start difference. First operand has 96 places, 96 transitions, 324 flow. Second operand 6 states and 317 transitions. [2025-03-04 15:21:40,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 184 transitions, 912 flow [2025-03-04 15:21:40,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 184 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:40,756 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 332 flow [2025-03-04 15:21:40,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2025-03-04 15:21:40,757 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 20 predicate places. [2025-03-04 15:21:40,758 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 332 flow [2025-03-04 15:21:40,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:40,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:40,759 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:21:40,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:21:40,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:40,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:40,761 INFO L85 PathProgramCache]: Analyzing trace with hash 249208072, now seen corresponding path program 1 times [2025-03-04 15:21:40,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:40,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973109377] [2025-03-04 15:21:40,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:40,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:40,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:21:40,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:21:40,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:40,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:40,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:40,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973109377] [2025-03-04 15:21:40,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973109377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:40,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:40,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:21:40,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037135587] [2025-03-04 15:21:40,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:40,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:40,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:40,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:40,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:40,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 91 [2025-03-04 15:21:40,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:40,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:40,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 91 [2025-03-04 15:21:40,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:41,528 INFO L124 PetriNetUnfolderBase]: 6285/12485 cut-off events. [2025-03-04 15:21:41,529 INFO L125 PetriNetUnfolderBase]: For 5083/5083 co-relation queries the response was YES. [2025-03-04 15:21:41,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27035 conditions, 12485 events. 6285/12485 cut-off events. For 5083/5083 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 103421 event pairs, 1484 based on Foata normal form. 177/11992 useless extension candidates. Maximal degree in co-relation 26385. Up to 8674 conditions per place. [2025-03-04 15:21:41,685 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 120 selfloop transitions, 6 changer transitions 0/159 dead transitions. [2025-03-04 15:21:41,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 159 transitions, 794 flow [2025-03-04 15:21:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2025-03-04 15:21:41,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2025-03-04 15:21:41,686 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 332 flow. Second operand 4 states and 224 transitions. [2025-03-04 15:21:41,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 159 transitions, 794 flow [2025-03-04 15:21:41,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 159 transitions, 778 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:21:41,697 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 332 flow [2025-03-04 15:21:41,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2025-03-04 15:21:41,698 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 18 predicate places. [2025-03-04 15:21:41,698 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 332 flow [2025-03-04 15:21:41,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:41,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:41,699 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 15:21:41,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:21:41,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:41,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:41,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1029198146, now seen corresponding path program 1 times [2025-03-04 15:21:41,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:41,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217673652] [2025-03-04 15:21:41,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:41,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:21:41,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:21:41,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:41,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:41,711 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:21:41,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:21:41,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:21:41,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:41,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:41,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:21:41,731 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:21:41,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-04 15:21:41,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-04 15:21:41,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-04 15:21:41,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-04 15:21:41,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-04 15:21:41,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-04 15:21:41,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-04 15:21:41,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-04 15:21:41,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-04 15:21:41,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-04 15:21:41,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-04 15:21:41,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-04 15:21:41,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-04 15:21:41,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-04 15:21:41,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-04 15:21:41,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-04 15:21:41,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-04 15:21:41,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:21:41,733 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 15:21:41,734 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:21:41,734 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:21:41,762 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:21:41,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 123 transitions, 273 flow [2025-03-04 15:21:41,780 INFO L124 PetriNetUnfolderBase]: 34/225 cut-off events. [2025-03-04 15:21:41,781 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 15:21:41,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 225 events. 34/225 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 914 event pairs, 1 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 155. Up to 12 conditions per place. [2025-03-04 15:21:41,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 123 transitions, 273 flow [2025-03-04 15:21:41,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 123 transitions, 273 flow [2025-03-04 15:21:41,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:41,786 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;@5ba243d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:41,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 15:21:41,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:41,790 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:21:41,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:41,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:41,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:41,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:21:41,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:41,791 INFO L85 PathProgramCache]: Analyzing trace with hash 522639368, now seen corresponding path program 1 times [2025-03-04 15:21:41,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:41,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427516805] [2025-03-04 15:21:41,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:41,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:41,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:41,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:41,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:41,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:41,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:41,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427516805] [2025-03-04 15:21:41,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427516805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:41,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:41,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430062285] [2025-03-04 15:21:41,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:41,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:41,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:41,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:41,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:41,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 123 [2025-03-04 15:21:41,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 123 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:41,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:41,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 123 [2025-03-04 15:21:41,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:50,959 INFO L124 PetriNetUnfolderBase]: 97039/172514 cut-off events. [2025-03-04 15:21:50,960 INFO L125 PetriNetUnfolderBase]: For 2042/2042 co-relation queries the response was YES. [2025-03-04 15:21:51,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308166 conditions, 172514 events. 97039/172514 cut-off events. For 2042/2042 co-relation queries the response was YES. Maximal size of possible extension queue 3647. Compared 1785364 event pairs, 63133 based on Foata normal form. 26434/183879 useless extension candidates. Maximal degree in co-relation 18108. Up to 134303 conditions per place. [2025-03-04 15:21:51,748 INFO L140 encePairwiseOnDemand]: 97/123 looper letters, 82 selfloop transitions, 3 changer transitions 0/130 dead transitions. [2025-03-04 15:21:51,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 130 transitions, 457 flow [2025-03-04 15:21:51,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 300 transitions. [2025-03-04 15:21:51,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-03-04 15:21:51,750 INFO L175 Difference]: Start difference. First operand has 107 places, 123 transitions, 273 flow. Second operand 4 states and 300 transitions. [2025-03-04 15:21:51,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 130 transitions, 457 flow [2025-03-04 15:21:51,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 130 transitions, 457 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:51,753 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 257 flow [2025-03-04 15:21:51,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2025-03-04 15:21:51,754 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2025-03-04 15:21:51,754 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 257 flow [2025-03-04 15:21:51,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:51,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:51,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:51,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:21:51,754 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:21:51,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:51,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1504698717, now seen corresponding path program 1 times [2025-03-04 15:21:51,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:51,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873808301] [2025-03-04 15:21:51,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:51,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:51,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:21:51,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:21:51,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:51,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:51,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:51,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873808301] [2025-03-04 15:21:51,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873808301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:51,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:51,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:21:51,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350149508] [2025-03-04 15:21:51,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:51,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:21:51,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:51,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:21:51,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:21:51,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 123 [2025-03-04 15:21:51,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:51,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:51,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 123 [2025-03-04 15:21:51,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:06,432 INFO L124 PetriNetUnfolderBase]: 147779/250918 cut-off events. [2025-03-04 15:22:06,433 INFO L125 PetriNetUnfolderBase]: For 8857/14438 co-relation queries the response was YES. [2025-03-04 15:22:07,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464639 conditions, 250918 events. 147779/250918 cut-off events. For 8857/14438 co-relation queries the response was YES. Maximal size of possible extension queue 5545. Compared 2600954 event pairs, 40828 based on Foata normal form. 4264/236770 useless extension candidates. Maximal degree in co-relation 464532. Up to 125335 conditions per place. [2025-03-04 15:22:08,067 INFO L140 encePairwiseOnDemand]: 111/123 looper letters, 247 selfloop transitions, 26 changer transitions 0/320 dead transitions. [2025-03-04 15:22:08,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 320 transitions, 1334 flow [2025-03-04 15:22:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:22:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:22:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 597 transitions. [2025-03-04 15:22:08,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6933797909407665 [2025-03-04 15:22:08,069 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 257 flow. Second operand 7 states and 597 transitions. [2025-03-04 15:22:08,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 320 transitions, 1334 flow [2025-03-04 15:22:08,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 320 transitions, 1329 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:08,083 INFO L231 Difference]: Finished difference. Result has 123 places, 134 transitions, 457 flow [2025-03-04 15:22:08,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=457, PETRI_PLACES=123, PETRI_TRANSITIONS=134} [2025-03-04 15:22:08,083 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 16 predicate places. [2025-03-04 15:22:08,083 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 134 transitions, 457 flow [2025-03-04 15:22:08,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:08,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:08,083 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:08,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:22:08,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:22:08,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:08,084 INFO L85 PathProgramCache]: Analyzing trace with hash 659004648, now seen corresponding path program 1 times [2025-03-04 15:22:08,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:08,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250473690] [2025-03-04 15:22:08,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:08,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:08,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:22:08,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:22:08,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:08,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:08,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:08,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250473690] [2025-03-04 15:22:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250473690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:08,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:08,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:22:08,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426434936] [2025-03-04 15:22:08,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:08,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:08,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:08,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:08,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:22:08,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 123 [2025-03-04 15:22:08,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 134 transitions, 457 flow. Second operand has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:08,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:08,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 123 [2025-03-04 15:22:08,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand