./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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_08-cond_racefree.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 b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:37:45,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:37:45,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:37:45,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:37:45,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:37:45,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:37:45,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:37:45,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:37:45,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:37:45,471 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:37:45,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:37:45,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:37:45,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:37:45,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:37:45,471 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:37:45,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:37:45,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:37:45,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:37:45,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:37:45,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:37:45,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:37:45,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:37:45,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:37:45,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:37:45,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:37:45,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:37:45,473 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 -> b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 [2025-03-17 19:37:45,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:37:45,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:37:45,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:37:45,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:37:45,693 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:37:45,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2025-03-17 19:37:46,814 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74afbd342/06748a5a18e04895a63494cbac839c58/FLAG1c36d4f05 [2025-03-17 19:37:47,149 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:37:47,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2025-03-17 19:37:47,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74afbd342/06748a5a18e04895a63494cbac839c58/FLAG1c36d4f05 [2025-03-17 19:37:47,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74afbd342/06748a5a18e04895a63494cbac839c58 [2025-03-17 19:37:47,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:37:47,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:37:47,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:37:47,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:37:47,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:37:47,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415ccde2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47, skipping insertion in model container [2025-03-17 19:37:47,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:37:47,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:37:47,787 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:37:47,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:37:47,876 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:37:47,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47 WrapperNode [2025-03-17 19:37:47,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:37:47,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:37:47,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:37:47,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:37:47,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,915 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2025-03-17 19:37:47,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:37:47,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:37:47,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:37:47,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:37:47,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,951 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-03-17 19:37:47,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,959 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:37:47,971 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:37:47,971 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:37:47,971 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:37:47,972 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47" (1/1) ... [2025-03-17 19:37:47,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:37:47,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:37:48,005 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-17 19:37:48,008 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-17 19:37:48,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:37:48,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:37:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 19:37:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:37:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:37:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:37:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 19:37:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:37:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:37:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:37:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 19:37:48,032 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 19:37:48,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:37:48,032 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 19:37:48,032 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 19:37:48,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:37:48,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:37:48,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:37:48,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 19:37:48,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:37:48,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:37:48,034 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 19:37:48,166 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:37:48,167 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:37:48,366 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L945: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-17 19:37:48,366 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-17 19:37:48,407 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:37:48,407 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:37:48,602 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:37:48,603 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:37:48,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:37:48 BoogieIcfgContainer [2025-03-17 19:37:48,603 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:37:48,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:37:48,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:37:48,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:37:48,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:37:47" (1/3) ... [2025-03-17 19:37:48,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7087db1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:37:48, skipping insertion in model container [2025-03-17 19:37:48,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:37:47" (2/3) ... [2025-03-17 19:37:48,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7087db1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:37:48, skipping insertion in model container [2025-03-17 19:37:48,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:37:48" (3/3) ... [2025-03-17 19:37:48,613 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2025-03-17 19:37:48,623 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:37:48,624 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_08-cond_racefree.i that has 2 procedures, 54 locations, 1 initial locations, 5 loop locations, and 8 error locations. [2025-03-17 19:37:48,625 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:37:48,656 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 19:37:48,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 66 transitions, 139 flow [2025-03-17 19:37:48,726 INFO L124 PetriNetUnfolderBase]: 17/88 cut-off events. [2025-03-17 19:37:48,729 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:37:48,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 88 events. 17/88 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 265 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 57. Up to 6 conditions per place. [2025-03-17 19:37:48,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 66 transitions, 139 flow [2025-03-17 19:37:48,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 65 transitions, 137 flow [2025-03-17 19:37:48,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:37:48,752 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;@11c3236e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:37:48,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 19:37:48,757 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:37:48,757 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-03-17 19:37:48,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:37:48,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:37:48,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 19:37:48,758 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-17 19:37:48,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:37:48,762 INFO L85 PathProgramCache]: Analyzing trace with hash 416213452, now seen corresponding path program 1 times [2025-03-17 19:37:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:37:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401260491] [2025-03-17 19:37:48,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:37:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:37:48,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:37:48,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:37:48,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:37:48,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:37:49,036 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-17 19:37:49,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:37:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401260491] [2025-03-17 19:37:49,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401260491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:37:49,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:37:49,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:37:49,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091759512] [2025-03-17 19:37:49,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:37:49,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:37:49,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:37:49,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:37:49,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:37:49,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 66 [2025-03-17 19:37:49,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 65 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-17 19:37:49,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:37:49,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 66 [2025-03-17 19:37:49,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:37:49,313 INFO L124 PetriNetUnfolderBase]: 171/508 cut-off events. [2025-03-17 19:37:49,313 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:37:49,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 508 events. 171/508 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2673 event pairs, 21 based on Foata normal form. 64/483 useless extension candidates. Maximal degree in co-relation 790. Up to 220 conditions per place. [2025-03-17 19:37:49,318 INFO L140 encePairwiseOnDemand]: 53/66 looper letters, 46 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2025-03-17 19:37:49,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 263 flow [2025-03-17 19:37:49,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:37:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:37:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2025-03-17 19:37:49,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6931818181818182 [2025-03-17 19:37:49,328 INFO L175 Difference]: Start difference. First operand has 57 places, 65 transitions, 137 flow. Second operand 4 states and 183 transitions. [2025-03-17 19:37:49,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 263 flow [2025-03-17 19:37:49,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 263 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:37:49,334 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 127 flow [2025-03-17 19:37:49,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-03-17 19:37:49,339 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2025-03-17 19:37:49,340 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 127 flow [2025-03-17 19:37:49,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-17 19:37:49,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:37:49,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:37:49,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:37:49,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:37:49,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:37:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash 17715470, now seen corresponding path program 1 times [2025-03-17 19:37:49,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:37:49,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890321293] [2025-03-17 19:37:49,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:37:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:37:49,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:37:49,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:37:49,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:37:49,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:37:49,469 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-17 19:37:49,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:37:49,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890321293] [2025-03-17 19:37:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890321293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:37:49,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:37:49,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:37:49,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334488472] [2025-03-17 19:37:49,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:37:49,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:37:49,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:37:49,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:37:49,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:37:49,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 66 [2025-03-17 19:37:49,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-17 19:37:49,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:37:49,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 66 [2025-03-17 19:37:49,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:37:49,602 INFO L124 PetriNetUnfolderBase]: 165/483 cut-off events. [2025-03-17 19:37:49,602 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 19:37:49,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 483 events. 165/483 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2480 event pairs, 62 based on Foata normal form. 13/442 useless extension candidates. Maximal degree in co-relation 815. Up to 279 conditions per place. [2025-03-17 19:37:49,605 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 47 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2025-03-17 19:37:49,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 78 transitions, 271 flow [2025-03-17 19:37:49,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:37:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:37:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-03-17 19:37:49,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-03-17 19:37:49,607 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 127 flow. Second operand 4 states and 164 transitions. [2025-03-17 19:37:49,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 78 transitions, 271 flow [2025-03-17 19:37:49,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 263 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:37:49,609 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 127 flow [2025-03-17 19:37:49,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2025-03-17 19:37:49,610 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2025-03-17 19:37:49,610 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 127 flow [2025-03-17 19:37:49,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-17 19:37:49,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:37:49,610 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:37:49,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 19:37:49,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:37:49,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:37:49,611 INFO L85 PathProgramCache]: Analyzing trace with hash -155288419, now seen corresponding path program 1 times [2025-03-17 19:37:49,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:37:49,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335630543] [2025-03-17 19:37:49,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:37:49,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:37:49,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:37:49,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:37:49,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:37:49,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:37:49,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:37:49,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:37:49,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:37:49,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:37:49,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:37:49,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:37:49,690 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 19:37:49,691 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-17 19:37:49,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-17 19:37:49,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-17 19:37:49,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-17 19:37:49,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-17 19:37:49,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-17 19:37:49,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-17 19:37:49,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-17 19:37:49,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-17 19:37:49,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-17 19:37:49,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-17 19:37:49,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-17 19:37:49,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-17 19:37:49,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:37:49,693 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 19:37:49,695 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 19:37:49,695 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 19:37:49,746 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 19:37:49,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 98 transitions, 212 flow [2025-03-17 19:37:49,763 INFO L124 PetriNetUnfolderBase]: 30/161 cut-off events. [2025-03-17 19:37:49,764 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 19:37:49,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 161 events. 30/161 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 599 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 96. Up to 9 conditions per place. [2025-03-17 19:37:49,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 98 transitions, 212 flow [2025-03-17 19:37:49,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 98 transitions, 212 flow [2025-03-17 19:37:49,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:37:49,771 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;@11c3236e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:37:49,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-17 19:37:49,773 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:37:49,774 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-03-17 19:37:49,774 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:37:49,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:37:49,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 19:37:49,776 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-17 19:37:49,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:37:49,777 INFO L85 PathProgramCache]: Analyzing trace with hash 509764172, now seen corresponding path program 1 times [2025-03-17 19:37:49,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:37:49,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011310675] [2025-03-17 19:37:49,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:37:49,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:37:49,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:37:49,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:37:49,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:37:49,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:37:49,855 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-17 19:37:49,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:37:49,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011310675] [2025-03-17 19:37:49,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011310675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:37:49,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:37:49,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:37:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341023670] [2025-03-17 19:37:49,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:37:49,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:37:49,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:37:49,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:37:49,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:37:49,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 98 [2025-03-17 19:37:49,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 98 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-17 19:37:49,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:37:49,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 98 [2025-03-17 19:37:49,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:37:50,598 INFO L124 PetriNetUnfolderBase]: 3972/8154 cut-off events. [2025-03-17 19:37:50,598 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-17 19:37:50,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14136 conditions, 8154 events. 3972/8154 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 65843 event pairs, 657 based on Foata normal form. 1288/8315 useless extension candidates. Maximal degree in co-relation 9852. Up to 3901 conditions per place. [2025-03-17 19:37:50,660 INFO L140 encePairwiseOnDemand]: 79/98 looper letters, 82 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2025-03-17 19:37:50,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 127 transitions, 442 flow [2025-03-17 19:37:50,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:37:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:37:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 289 transitions. [2025-03-17 19:37:50,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7372448979591837 [2025-03-17 19:37:50,662 INFO L175 Difference]: Start difference. First operand has 84 places, 98 transitions, 212 flow. Second operand 4 states and 289 transitions. [2025-03-17 19:37:50,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 127 transitions, 442 flow [2025-03-17 19:37:50,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 127 transitions, 442 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:37:50,665 INFO L231 Difference]: Finished difference. Result has 86 places, 83 transitions, 190 flow [2025-03-17 19:37:50,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=86, PETRI_TRANSITIONS=83} [2025-03-17 19:37:50,666 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 2 predicate places. [2025-03-17 19:37:50,666 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 83 transitions, 190 flow [2025-03-17 19:37:50,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-17 19:37:50,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:37:50,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:37:50,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:37:50,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-17 19:37:50,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:37:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1377179408, now seen corresponding path program 1 times [2025-03-17 19:37:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:37:50,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430248607] [2025-03-17 19:37:50,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:37:50,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:37:50,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:37:50,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:37:50,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:37:50,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:37:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:37:50,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:37:50,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430248607] [2025-03-17 19:37:50,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430248607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:37:50,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:37:50,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:37:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723518006] [2025-03-17 19:37:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:37:50,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:37:50,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:37:50,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:37:50,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:37:50,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 98 [2025-03-17 19:37:50,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 83 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-17 19:37:50,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:37:50,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 98 [2025-03-17 19:37:50,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:37:51,412 INFO L124 PetriNetUnfolderBase]: 4455/9303 cut-off events. [2025-03-17 19:37:51,412 INFO L125 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2025-03-17 19:37:51,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16546 conditions, 9303 events. 4455/9303 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 77757 event pairs, 1820 based on Foata normal form. 13/8478 useless extension candidates. Maximal degree in co-relation 1318. Up to 6669 conditions per place. [2025-03-17 19:37:51,460 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 64 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2025-03-17 19:37:51,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 108 transitions, 378 flow [2025-03-17 19:37:51,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:37:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:37:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-03-17 19:37:51,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5943877551020408 [2025-03-17 19:37:51,463 INFO L175 Difference]: Start difference. First operand has 86 places, 83 transitions, 190 flow. Second operand 4 states and 233 transitions. [2025-03-17 19:37:51,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 108 transitions, 378 flow [2025-03-17 19:37:51,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 108 transitions, 366 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:37:51,466 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 204 flow [2025-03-17 19:37:51,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2025-03-17 19:37:51,470 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 4 predicate places. [2025-03-17 19:37:51,470 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 204 flow [2025-03-17 19:37:51,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-17 19:37:51,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:37:51,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:37:51,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:37:51,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-17 19:37:51,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:37:51,471 INFO L85 PathProgramCache]: Analyzing trace with hash -579578546, now seen corresponding path program 1 times [2025-03-17 19:37:51,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:37:51,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807388488] [2025-03-17 19:37:51,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:37:51,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:37:51,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:37:51,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:37:51,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:37:51,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:37:51,542 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-17 19:37:51,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:37:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807388488] [2025-03-17 19:37:51,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807388488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:37:51,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:37:51,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:37:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670433058] [2025-03-17 19:37:51,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:37:51,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:37:51,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:37:51,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:37:51,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:37:51,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 98 [2025-03-17 19:37:51,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-17 19:37:51,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:37:51,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 98 [2025-03-17 19:37:51,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:37:52,506 INFO L124 PetriNetUnfolderBase]: 6297/12851 cut-off events. [2025-03-17 19:37:52,507 INFO L125 PetriNetUnfolderBase]: For 456/627 co-relation queries the response was YES. [2025-03-17 19:37:52,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22936 conditions, 12851 events. 6297/12851 cut-off events. For 456/627 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 111263 event pairs, 1495 based on Foata normal form. 232/11742 useless extension candidates. Maximal degree in co-relation 22836. Up to 6450 conditions per place. [2025-03-17 19:37:52,601 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 122 selfloop transitions, 12 changer transitions 0/176 dead transitions. [2025-03-17 19:37:52,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 176 transitions, 694 flow [2025-03-17 19:37:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:37:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:37:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2025-03-17 19:37:52,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7040816326530612 [2025-03-17 19:37:52,604 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 204 flow. Second operand 5 states and 345 transitions. [2025-03-17 19:37:52,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 176 transitions, 694 flow [2025-03-17 19:37:52,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 176 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:37:52,611 INFO L231 Difference]: Finished difference. Result has 95 places, 96 transitions, 296 flow [2025-03-17 19:37:52,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=95, PETRI_TRANSITIONS=96} [2025-03-17 19:37:52,612 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 11 predicate places. [2025-03-17 19:37:52,612 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 96 transitions, 296 flow [2025-03-17 19:37:52,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-17 19:37:52,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:37:52,613 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:37:52,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:37:52,614 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-17 19:37:52,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:37:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash 943763125, now seen corresponding path program 1 times [2025-03-17 19:37:52,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:37:52,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662548201] [2025-03-17 19:37:52,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:37:52,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:37:52,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:37:52,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:37:52,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:37:52,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:37:52,694 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-17 19:37:52,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:37:52,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662548201] [2025-03-17 19:37:52,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662548201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:37:52,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:37:52,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:37:52,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103689848] [2025-03-17 19:37:52,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:37:52,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:37:52,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:37:52,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:37:52,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:37:52,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 98 [2025-03-17 19:37:52,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 96 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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-17 19:37:52,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:37:52,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 98 [2025-03-17 19:37:52,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:37:53,513 INFO L124 PetriNetUnfolderBase]: 5316/11314 cut-off events. [2025-03-17 19:37:53,513 INFO L125 PetriNetUnfolderBase]: For 3181/3181 co-relation queries the response was YES. [2025-03-17 19:37:53,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22583 conditions, 11314 events. 5316/11314 cut-off events. For 3181/3181 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 98412 event pairs, 607 based on Foata normal form. 0/10100 useless extension candidates. Maximal degree in co-relation 19371. Up to 7025 conditions per place. [2025-03-17 19:37:53,567 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 103 selfloop transitions, 6 changer transitions 0/150 dead transitions. [2025-03-17 19:37:53,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 150 transitions, 684 flow [2025-03-17 19:37:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:37:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:37:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-03-17 19:37:53,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6403061224489796 [2025-03-17 19:37:53,569 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 296 flow. Second operand 4 states and 251 transitions. [2025-03-17 19:37:53,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 150 transitions, 684 flow [2025-03-17 19:37:53,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 150 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:37:53,575 INFO L231 Difference]: Finished difference. Result has 98 places, 96 transitions, 312 flow [2025-03-17 19:37:53,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=98, PETRI_TRANSITIONS=96} [2025-03-17 19:37:53,576 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 14 predicate places. [2025-03-17 19:37:53,576 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 96 transitions, 312 flow [2025-03-17 19:37:53,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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-17 19:37:53,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:37:53,576 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 19:37:53,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:37:53,576 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-17 19:37:53,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:37:53,577 INFO L85 PathProgramCache]: Analyzing trace with hash 718280930, now seen corresponding path program 1 times [2025-03-17 19:37:53,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:37:53,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262604509] [2025-03-17 19:37:53,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:37:53,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:37:53,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:37:53,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:37:53,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:37:53,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:37:53,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:37:53,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:37:53,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:37:53,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:37:53,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:37:53,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:37:53,632 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 19:37:53,632 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-17 19:37:53,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-17 19:37:53,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-17 19:37:53,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-17 19:37:53,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-17 19:37:53,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-17 19:37:53,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-17 19:37:53,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-17 19:37:53,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-17 19:37:53,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-17 19:37:53,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-17 19:37:53,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-17 19:37:53,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-17 19:37:53,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-17 19:37:53,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-17 19:37:53,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-17 19:37:53,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-17 19:37:53,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:37:53,633 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 19:37:53,634 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 19:37:53,634 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 19:37:53,655 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 19:37:53,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 130 transitions, 287 flow [2025-03-17 19:37:53,670 INFO L124 PetriNetUnfolderBase]: 46/253 cut-off events. [2025-03-17 19:37:53,671 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-17 19:37:53,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 253 events. 46/253 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1028 event pairs, 1 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2025-03-17 19:37:53,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 130 transitions, 287 flow [2025-03-17 19:37:53,674 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 130 transitions, 287 flow [2025-03-17 19:37:53,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:37:53,677 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;@11c3236e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:37:53,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-17 19:37:53,678 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:37:53,680 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-03-17 19:37:53,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:37:53,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:37:53,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 19:37:53,681 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-17 19:37:53,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:37:53,681 INFO L85 PathProgramCache]: Analyzing trace with hash 633852652, now seen corresponding path program 1 times [2025-03-17 19:37:53,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:37:53,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553298078] [2025-03-17 19:37:53,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:37:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:37:53,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:37:53,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:37:53,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:37:53,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:37:53,727 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-17 19:37:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:37:53,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553298078] [2025-03-17 19:37:53,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553298078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:37:53,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:37:53,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:37:53,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084646983] [2025-03-17 19:37:53,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:37:53,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:37:53,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:37:53,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:37:53,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:37:53,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 130 [2025-03-17 19:37:53,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 130 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-17 19:37:53,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:37:53,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 130 [2025-03-17 19:37:53,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:38:00,076 INFO L124 PetriNetUnfolderBase]: 71949/122836 cut-off events. [2025-03-17 19:38:00,076 INFO L125 PetriNetUnfolderBase]: For 1563/1563 co-relation queries the response was YES. [2025-03-17 19:38:00,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219933 conditions, 122836 events. 71949/122836 cut-off events. For 1563/1563 co-relation queries the response was YES. Maximal size of possible extension queue 2722. Compared 1204166 event pairs, 13366 based on Foata normal form. 21984/130774 useless extension candidates. Maximal degree in co-relation 84742. Up to 63142 conditions per place. [2025-03-17 19:38:00,754 INFO L140 encePairwiseOnDemand]: 105/130 looper letters, 117 selfloop transitions, 4 changer transitions 0/175 dead transitions. [2025-03-17 19:38:00,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 175 transitions, 619 flow [2025-03-17 19:38:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:38:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:38:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 394 transitions. [2025-03-17 19:38:00,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7576923076923077 [2025-03-17 19:38:00,756 INFO L175 Difference]: Start difference. First operand has 111 places, 130 transitions, 287 flow. Second operand 4 states and 394 transitions. [2025-03-17 19:38:00,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 175 transitions, 619 flow [2025-03-17 19:38:00,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 175 transitions, 619 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:38:00,759 INFO L231 Difference]: Finished difference. Result has 113 places, 109 transitions, 253 flow [2025-03-17 19:38:00,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=113, PETRI_TRANSITIONS=109} [2025-03-17 19:38:00,760 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 2 predicate places. [2025-03-17 19:38:00,760 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 109 transitions, 253 flow [2025-03-17 19:38:00,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-17 19:38:00,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:38:00,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:38:00,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:38:00,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-17 19:38:00,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:38:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1825403694, now seen corresponding path program 1 times [2025-03-17 19:38:00,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:38:00,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942620675] [2025-03-17 19:38:00,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:38:00,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:38:00,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:38:00,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:38:00,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:38:00,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:38:00,958 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-17 19:38:00,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:38:00,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942620675] [2025-03-17 19:38:00,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942620675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:38:00,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:38:00,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:38:00,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040736496] [2025-03-17 19:38:00,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:38:00,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:38:00,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:38:00,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:38:00,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:38:00,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 130 [2025-03-17 19:38:00,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 109 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-17 19:38:00,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:38:00,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 130 [2025-03-17 19:38:00,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:38:08,585 INFO L124 PetriNetUnfolderBase]: 82962/142351 cut-off events. [2025-03-17 19:38:08,586 INFO L125 PetriNetUnfolderBase]: For 7164/7164 co-relation queries the response was YES. [2025-03-17 19:38:08,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261453 conditions, 142351 events. 82962/142351 cut-off events. For 7164/7164 co-relation queries the response was YES. Maximal size of possible extension queue 3238. Compared 1408650 event pairs, 54073 based on Foata normal form. 13/131888 useless extension candidates. Maximal degree in co-relation 48807. Up to 112286 conditions per place. [2025-03-17 19:38:09,356 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 77 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2025-03-17 19:38:09,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 134 transitions, 467 flow [2025-03-17 19:38:09,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:38:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:38:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 298 transitions. [2025-03-17 19:38:09,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.573076923076923 [2025-03-17 19:38:09,358 INFO L175 Difference]: Start difference. First operand has 113 places, 109 transitions, 253 flow. Second operand 4 states and 298 transitions. [2025-03-17 19:38:09,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 134 transitions, 467 flow [2025-03-17 19:38:09,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 134 transitions, 455 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:38:09,368 INFO L231 Difference]: Finished difference. Result has 115 places, 111 transitions, 267 flow [2025-03-17 19:38:09,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=115, PETRI_TRANSITIONS=111} [2025-03-17 19:38:09,370 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 4 predicate places. [2025-03-17 19:38:09,371 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 267 flow [2025-03-17 19:38:09,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-17 19:38:09,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:38:09,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:38:09,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:38:09,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-17 19:38:09,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:38:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1199176942, now seen corresponding path program 1 times [2025-03-17 19:38:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:38:09,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971158978] [2025-03-17 19:38:09,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:38:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:38:09,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:38:09,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:38:09,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:38:09,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:38:09,432 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-17 19:38:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:38:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971158978] [2025-03-17 19:38:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971158978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:38:09,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:38:09,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:38:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805891517] [2025-03-17 19:38:09,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:38:09,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:38:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:38:09,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:38:09,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:38:09,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 130 [2025-03-17 19:38:09,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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-17 19:38:09,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:38:09,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 130 [2025-03-17 19:38:09,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:38:21,022 INFO L124 PetriNetUnfolderBase]: 125005/214385 cut-off events. [2025-03-17 19:38:21,022 INFO L125 PetriNetUnfolderBase]: For 7242/9501 co-relation queries the response was YES. [2025-03-17 19:38:21,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390757 conditions, 214385 events. 125005/214385 cut-off events. For 7242/9501 co-relation queries the response was YES. Maximal size of possible extension queue 4981. Compared 2224431 event pairs, 39782 based on Foata normal form. 3016/197418 useless extension candidates. Maximal degree in co-relation 390656. Up to 116991 conditions per place. [2025-03-17 19:38:22,318 INFO L140 encePairwiseOnDemand]: 119/130 looper letters, 174 selfloop transitions, 16 changer transitions 0/245 dead transitions. [2025-03-17 19:38:22,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 245 transitions, 985 flow [2025-03-17 19:38:22,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:38:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:38:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2025-03-17 19:38:22,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7169230769230769 [2025-03-17 19:38:22,320 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 267 flow. Second operand 5 states and 466 transitions. [2025-03-17 19:38:22,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 245 transitions, 985 flow [2025-03-17 19:38:22,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 245 transitions, 981 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:38:22,330 INFO L231 Difference]: Finished difference. Result has 122 places, 126 transitions, 393 flow [2025-03-17 19:38:22,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=393, PETRI_PLACES=122, PETRI_TRANSITIONS=126} [2025-03-17 19:38:22,331 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 11 predicate places. [2025-03-17 19:38:22,331 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 126 transitions, 393 flow [2025-03-17 19:38:22,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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-17 19:38:22,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:38:22,331 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:38:22,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:38:22,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-17 19:38:22,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:38:22,331 INFO L85 PathProgramCache]: Analyzing trace with hash 251644727, now seen corresponding path program 1 times [2025-03-17 19:38:22,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:38:22,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496479179] [2025-03-17 19:38:22,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:38:22,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:38:22,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:38:22,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:38:22,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:38:22,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:38:22,379 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-17 19:38:22,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:38:22,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496479179] [2025-03-17 19:38:22,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496479179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:38:22,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:38:22,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:38:22,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523999145] [2025-03-17 19:38:22,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:38:22,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:38:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:38:22,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:38:22,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:38:22,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 130 [2025-03-17 19:38:22,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 126 transitions, 393 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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-17 19:38:22,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:38:22,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 130 [2025-03-17 19:38:22,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand