./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fe12ce8951e45860142b9cebaa325eef531c18fa917882c03ee5396afb187f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:44:28,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:44:28,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:44:29,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:44:29,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:44:29,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:44:29,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:44:29,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:44:29,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:44:29,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:44:29,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:44:29,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:44:29,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:44:29,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:44:29,025 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:44:29,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:44:29,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:44:29,026 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:44:29,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:44:29,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:44:29,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:44:29,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:44:29,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:44:29,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:44:29,026 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:44:29,026 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:44:29,026 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:44:29,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:44:29,026 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:44:29,026 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:44:29,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:44:29,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:44:29,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:44:29,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:44:29,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:44:29,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:44:29,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:44:29,027 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:44:29,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:44:29,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:44:29,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:44:29,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:44:29,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:44:29,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:44:29,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:44:29,028 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fe12ce8951e45860142b9cebaa325eef531c18fa917882c03ee5396afb187f5 [2025-02-06 18:44:29,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:44:29,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:44:29,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:44:29,233 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:44:29,233 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:44:29,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i [2025-02-06 18:44:30,411 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c66c8486/186a3dfe960b429f9e57220ef132d70c/FLAGae90c85b0 [2025-02-06 18:44:30,698 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:44:30,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i [2025-02-06 18:44:30,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c66c8486/186a3dfe960b429f9e57220ef132d70c/FLAGae90c85b0 [2025-02-06 18:44:30,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c66c8486/186a3dfe960b429f9e57220ef132d70c [2025-02-06 18:44:30,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:44:30,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:44:30,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:44:30,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:44:30,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:44:30,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:44:30" (1/1) ... [2025-02-06 18:44:30,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a436c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:30, skipping insertion in model container [2025-02-06 18:44:30,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:44:30" (1/1) ... [2025-02-06 18:44:30,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:44:30,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:44:30,964 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:44:30,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:44:31,027 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:44:31,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31 WrapperNode [2025-02-06 18:44:31,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:44:31,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:44:31,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:44:31,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:44:31,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31" (1/1) ... [2025-02-06 18:44:31,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31" (1/1) ... [2025-02-06 18:44:31,053 INFO L138 Inliner]: procedures = 173, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-02-06 18:44:31,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:44:31,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:44:31,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:44:31,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:44:31,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31" (1/1) ... [2025-02-06 18:44:31,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31" (1/1) ... [2025-02-06 18:44:31,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31" (1/1) ... [2025-02-06 18:44:31,072 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 2, 5, 5]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 5, 5]. The 1 writes are split as follows [0, 1, 0, 0]. [2025-02-06 18:44:31,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31" (1/1) ... [2025-02-06 18:44:31,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31" (1/1) ... [2025-02-06 18:44:31,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31" (1/1) ... [2025-02-06 18:44:31,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31" (1/1) ... [2025-02-06 18:44:31,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31" (1/1) ... [2025-02-06 18:44:31,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31" (1/1) ... [2025-02-06 18:44:31,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:44:31,081 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:44:31,081 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:44:31,081 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:44:31,082 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31" (1/1) ... [2025-02-06 18:44:31,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:44:31,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:44:31,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:44:31,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:44:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:44:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:44:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:44:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 18:44:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:44:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:44:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:44:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 18:44:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 18:44:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:44:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:44:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 18:44:31,124 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 18:44:31,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:44:31,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:44:31,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:44:31,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:44:31,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 18:44:31,125 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 18:44:31,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:44:31,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:44:31,125 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:44:31,209 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:44:31,211 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:44:31,325 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 18:44:31,326 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 18:44:31,359 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:44:31,360 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:44:31,482 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:44:31,482 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:44:31,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:44:31 BoogieIcfgContainer [2025-02-06 18:44:31,482 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:44:31,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:44:31,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:44:31,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:44:31,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:44:30" (1/3) ... [2025-02-06 18:44:31,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ca58a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:44:31, skipping insertion in model container [2025-02-06 18:44:31,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:44:31" (2/3) ... [2025-02-06 18:44:31,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ca58a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:44:31, skipping insertion in model container [2025-02-06 18:44:31,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:44:31" (3/3) ... [2025-02-06 18:44:31,489 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_05-lockfuns_racefree.i [2025-02-06 18:44:31,499 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:44:31,500 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_05-lockfuns_racefree.i that has 2 procedures, 56 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-02-06 18:44:31,500 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:44:31,536 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 18:44:31,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 65 transitions, 137 flow [2025-02-06 18:44:31,597 INFO L124 PetriNetUnfolderBase]: 11/82 cut-off events. [2025-02-06 18:44:31,602 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:44:31,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 82 events. 11/82 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 260 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2025-02-06 18:44:31,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 65 transitions, 137 flow [2025-02-06 18:44:31,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 64 transitions, 135 flow [2025-02-06 18:44:31,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:44:31,627 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;@3baea3d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:44:31,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-06 18:44:31,634 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:44:31,635 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-06 18:44:31,635 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:44:31,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:44:31,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:44:31,638 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-02-06 18:44:31,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:44:31,643 INFO L85 PathProgramCache]: Analyzing trace with hash 306946763, now seen corresponding path program 1 times [2025-02-06 18:44:31,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:44:31,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646812706] [2025-02-06 18:44:31,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:44:31,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:44:31,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:44:31,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:44:31,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:44:31,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:44:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:44:31,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:44:31,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646812706] [2025-02-06 18:44:31,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646812706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:44:31,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:44:31,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:44:31,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443360164] [2025-02-06 18:44:31,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:44:31,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:44:31,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:44:31,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:44:31,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:44:31,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 65 [2025-02-06 18:44:31,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 64 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-02-06 18:44:31,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:44:31,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 65 [2025-02-06 18:44:31,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:44:32,149 INFO L124 PetriNetUnfolderBase]: 169/474 cut-off events. [2025-02-06 18:44:32,149 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:44:32,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 474 events. 169/474 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2315 event pairs, 0 based on Foata normal form. 126/562 useless extension candidates. Maximal degree in co-relation 816. Up to 326 conditions per place. [2025-02-06 18:44:32,155 INFO L140 encePairwiseOnDemand]: 51/65 looper letters, 53 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2025-02-06 18:44:32,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 81 transitions, 281 flow [2025-02-06 18:44:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:44:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:44:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2025-02-06 18:44:32,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6884615384615385 [2025-02-06 18:44:32,167 INFO L175 Difference]: Start difference. First operand has 59 places, 64 transitions, 135 flow. Second operand 4 states and 179 transitions. [2025-02-06 18:44:32,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 81 transitions, 281 flow [2025-02-06 18:44:32,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 81 transitions, 281 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:44:32,173 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 125 flow [2025-02-06 18:44:32,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-02-06 18:44:32,177 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2025-02-06 18:44:32,178 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 125 flow [2025-02-06 18:44:32,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-02-06 18:44:32,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:44:32,178 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:44:32,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:44:32,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:44:32,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:44:32,179 INFO L85 PathProgramCache]: Analyzing trace with hash 265907004, now seen corresponding path program 1 times [2025-02-06 18:44:32,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:44:32,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989418788] [2025-02-06 18:44:32,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:44:32,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:44:32,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:44:32,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:44:32,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:44:32,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:44:32,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:44:32,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:44:32,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:44:32,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:44:32,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:44:32,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:44:32,241 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:44:32,242 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-06 18:44:32,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-06 18:44:32,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-06 18:44:32,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-06 18:44:32,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-06 18:44:32,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-06 18:44:32,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-06 18:44:32,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-06 18:44:32,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-06 18:44:32,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-06 18:44:32,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-06 18:44:32,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-06 18:44:32,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-06 18:44:32,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:44:32,246 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 18:44:32,248 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:44:32,248 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 18:44:32,268 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 18:44:32,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 101 transitions, 218 flow [2025-02-06 18:44:32,297 INFO L124 PetriNetUnfolderBase]: 21/154 cut-off events. [2025-02-06 18:44:32,298 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 18:44:32,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 154 events. 21/154 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 589 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 99. Up to 6 conditions per place. [2025-02-06 18:44:32,301 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 101 transitions, 218 flow [2025-02-06 18:44:32,302 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 101 transitions, 218 flow [2025-02-06 18:44:32,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:44:32,303 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;@3baea3d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:44:32,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-06 18:44:32,305 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:44:32,305 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 18:44:32,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:44:32,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:44:32,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:44:32,305 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-02-06 18:44:32,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:44:32,306 INFO L85 PathProgramCache]: Analyzing trace with hash 403364242, now seen corresponding path program 1 times [2025-02-06 18:44:32,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:44:32,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733163330] [2025-02-06 18:44:32,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:44:32,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:44:32,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:44:32,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:44:32,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:44:32,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:44:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:44:32,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:44:32,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733163330] [2025-02-06 18:44:32,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733163330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:44:32,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:44:32,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:44:32,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297935021] [2025-02-06 18:44:32,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:44:32,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:44:32,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:44:32,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:44:32,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:44:32,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 101 [2025-02-06 18:44:32,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 101 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-02-06 18:44:32,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:44:32,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 101 [2025-02-06 18:44:32,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:44:33,400 INFO L124 PetriNetUnfolderBase]: 5891/12737 cut-off events. [2025-02-06 18:44:33,401 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-02-06 18:44:33,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22114 conditions, 12737 events. 5891/12737 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 110299 event pairs, 2782 based on Foata normal form. 3179/14754 useless extension candidates. Maximal degree in co-relation 1528. Up to 9257 conditions per place. [2025-02-06 18:44:33,466 INFO L140 encePairwiseOnDemand]: 81/101 looper letters, 73 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-02-06 18:44:33,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 116 transitions, 400 flow [2025-02-06 18:44:33,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:44:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:44:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2025-02-06 18:44:33,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.655940594059406 [2025-02-06 18:44:33,469 INFO L175 Difference]: Start difference. First operand has 90 places, 101 transitions, 218 flow. Second operand 4 states and 265 transitions. [2025-02-06 18:44:33,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 116 transitions, 400 flow [2025-02-06 18:44:33,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 116 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:44:33,474 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 214 flow [2025-02-06 18:44:33,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2025-02-06 18:44:33,475 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2025-02-06 18:44:33,475 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 214 flow [2025-02-06 18:44:33,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-02-06 18:44:33,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:44:33,475 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:44:33,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:44:33,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:44:33,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:44:33,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1210983481, now seen corresponding path program 1 times [2025-02-06 18:44:33,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:44:33,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50301179] [2025-02-06 18:44:33,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:44:33,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:44:33,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:44:33,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:44:33,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:44:33,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:44:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:44:33,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:44:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50301179] [2025-02-06 18:44:33,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50301179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:44:33,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:44:33,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:44:33,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081204727] [2025-02-06 18:44:33,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:44:33,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:44:33,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:44:33,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:44:33,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:44:33,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 101 [2025-02-06 18:44:33,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 41.5) internal successors, (249), 6 states have internal predecessors, (249), 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-02-06 18:44:33,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:44:33,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 101 [2025-02-06 18:44:33,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:44:34,490 INFO L124 PetriNetUnfolderBase]: 5527/10696 cut-off events. [2025-02-06 18:44:34,491 INFO L125 PetriNetUnfolderBase]: For 816/816 co-relation queries the response was YES. [2025-02-06 18:44:34,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20371 conditions, 10696 events. 5527/10696 cut-off events. For 816/816 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 84893 event pairs, 622 based on Foata normal form. 196/10239 useless extension candidates. Maximal degree in co-relation 3145. Up to 6025 conditions per place. [2025-02-06 18:44:34,545 INFO L140 encePairwiseOnDemand]: 96/101 looper letters, 121 selfloop transitions, 6 changer transitions 0/167 dead transitions. [2025-02-06 18:44:34,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 167 transitions, 622 flow [2025-02-06 18:44:34,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:44:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:44:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 368 transitions. [2025-02-06 18:44:34,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6072607260726073 [2025-02-06 18:44:34,548 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 214 flow. Second operand 6 states and 368 transitions. [2025-02-06 18:44:34,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 167 transitions, 622 flow [2025-02-06 18:44:34,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 167 transitions, 620 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:44:34,555 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 220 flow [2025-02-06 18:44:34,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2025-02-06 18:44:34,556 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 8 predicate places. [2025-02-06 18:44:34,557 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 220 flow [2025-02-06 18:44:34,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.5) internal successors, (249), 6 states have internal predecessors, (249), 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-02-06 18:44:34,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:44:34,557 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:44:34,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:44:34,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:44:34,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:44:34,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1114218118, now seen corresponding path program 1 times [2025-02-06 18:44:34,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:44:34,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357143043] [2025-02-06 18:44:34,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:44:34,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:44:34,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:44:34,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:44:34,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:44:34,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:44:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:44:34,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:44:34,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357143043] [2025-02-06 18:44:34,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357143043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:44:34,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:44:34,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:44:34,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523531740] [2025-02-06 18:44:34,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:44:34,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:44:34,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:44:34,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:44:34,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:44:34,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 101 [2025-02-06 18:44:34,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 220 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-02-06 18:44:34,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:44:34,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 101 [2025-02-06 18:44:34,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:44:35,326 INFO L124 PetriNetUnfolderBase]: 5163/9821 cut-off events. [2025-02-06 18:44:35,327 INFO L125 PetriNetUnfolderBase]: For 1711/1711 co-relation queries the response was YES. [2025-02-06 18:44:35,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19357 conditions, 9821 events. 5163/9821 cut-off events. For 1711/1711 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 75701 event pairs, 964 based on Foata normal form. 196/9633 useless extension candidates. Maximal degree in co-relation 11664. Up to 6612 conditions per place. [2025-02-06 18:44:35,361 INFO L140 encePairwiseOnDemand]: 96/101 looper letters, 94 selfloop transitions, 6 changer transitions 0/140 dead transitions. [2025-02-06 18:44:35,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 140 transitions, 522 flow [2025-02-06 18:44:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:44:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:44:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2025-02-06 18:44:35,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410891089108911 [2025-02-06 18:44:35,363 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 220 flow. Second operand 4 states and 259 transitions. [2025-02-06 18:44:35,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 140 transitions, 522 flow [2025-02-06 18:44:35,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 140 transitions, 506 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-06 18:44:35,372 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 220 flow [2025-02-06 18:44:35,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2025-02-06 18:44:35,373 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 6 predicate places. [2025-02-06 18:44:35,373 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 220 flow [2025-02-06 18:44:35,373 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-02-06 18:44:35,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:44:35,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:44:35,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:44:35,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:44:35,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:44:35,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1627894516, now seen corresponding path program 1 times [2025-02-06 18:44:35,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:44:35,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577324971] [2025-02-06 18:44:35,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:44:35,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:44:35,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:44:35,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:44:35,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:44:35,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:44:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:44:35,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:44:35,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577324971] [2025-02-06 18:44:35,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577324971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:44:35,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:44:35,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:44:35,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790719300] [2025-02-06 18:44:35,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:44:35,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:44:35,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:44:35,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:44:35,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:44:35,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 101 [2025-02-06 18:44:35,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 220 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-02-06 18:44:35,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:44:35,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 101 [2025-02-06 18:44:35,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:44:36,248 INFO L124 PetriNetUnfolderBase]: 7335/15891 cut-off events. [2025-02-06 18:44:36,248 INFO L125 PetriNetUnfolderBase]: For 1973/1973 co-relation queries the response was YES. [2025-02-06 18:44:36,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28679 conditions, 15891 events. 7335/15891 cut-off events. For 1973/1973 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 143532 event pairs, 2168 based on Foata normal form. 248/14898 useless extension candidates. Maximal degree in co-relation 20691. Up to 7118 conditions per place. [2025-02-06 18:44:36,296 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 133 selfloop transitions, 12 changer transitions 0/185 dead transitions. [2025-02-06 18:44:36,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 185 transitions, 763 flow [2025-02-06 18:44:36,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:44:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:44:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 350 transitions. [2025-02-06 18:44:36,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.693069306930693 [2025-02-06 18:44:36,298 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 220 flow. Second operand 5 states and 350 transitions. [2025-02-06 18:44:36,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 185 transitions, 763 flow [2025-02-06 18:44:36,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 185 transitions, 747 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:44:36,301 INFO L231 Difference]: Finished difference. Result has 102 places, 99 transitions, 306 flow [2025-02-06 18:44:36,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=102, PETRI_TRANSITIONS=99} [2025-02-06 18:44:36,302 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 12 predicate places. [2025-02-06 18:44:36,302 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 99 transitions, 306 flow [2025-02-06 18:44:36,302 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-02-06 18:44:36,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:44:36,302 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-06 18:44:36,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:44:36,303 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-02-06 18:44:36,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:44:36,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1316767911, now seen corresponding path program 1 times [2025-02-06 18:44:36,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:44:36,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200982389] [2025-02-06 18:44:36,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:44:36,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:44:36,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:44:36,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:44:36,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:44:36,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:44:36,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:44:36,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:44:36,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:44:36,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:44:36,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:44:36,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:44:36,324 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:44:36,324 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-06 18:44:36,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-02-06 18:44:36,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-02-06 18:44:36,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-02-06 18:44:36,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-02-06 18:44:36,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-02-06 18:44:36,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-02-06 18:44:36,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-02-06 18:44:36,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-02-06 18:44:36,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-02-06 18:44:36,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-02-06 18:44:36,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-02-06 18:44:36,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-02-06 18:44:36,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-02-06 18:44:36,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-02-06 18:44:36,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-02-06 18:44:36,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-02-06 18:44:36,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:44:36,325 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 18:44:36,325 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:44:36,325 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 18:44:36,342 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 18:44:36,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 137 transitions, 301 flow [2025-02-06 18:44:36,354 INFO L124 PetriNetUnfolderBase]: 34/245 cut-off events. [2025-02-06 18:44:36,354 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 18:44:36,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 245 events. 34/245 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1048 event pairs, 1 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 169. Up to 12 conditions per place. [2025-02-06 18:44:36,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 137 transitions, 301 flow [2025-02-06 18:44:36,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 137 transitions, 301 flow [2025-02-06 18:44:36,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:44:36,358 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;@3baea3d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:44:36,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-06 18:44:36,359 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:44:36,359 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 18:44:36,359 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:44:36,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:44:36,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:44:36,359 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-02-06 18:44:36,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:44:36,359 INFO L85 PathProgramCache]: Analyzing trace with hash 534136701, now seen corresponding path program 1 times [2025-02-06 18:44:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:44:36,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823264693] [2025-02-06 18:44:36,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:44:36,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:44:36,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:44:36,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:44:36,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:44:36,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:44:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:44:36,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:44:36,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823264693] [2025-02-06 18:44:36,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823264693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:44:36,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:44:36,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:44:36,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557117003] [2025-02-06 18:44:36,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:44:36,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:44:36,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:44:36,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:44:36,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:44:36,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 137 [2025-02-06 18:44:36,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 137 transitions, 301 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-02-06 18:44:36,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:44:36,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 137 [2025-02-06 18:44:36,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:44:48,511 INFO L124 PetriNetUnfolderBase]: 129214/239278 cut-off events. [2025-02-06 18:44:48,511 INFO L125 PetriNetUnfolderBase]: For 2119/2119 co-relation queries the response was YES. [2025-02-06 18:44:48,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419132 conditions, 239278 events. 129214/239278 cut-off events. For 2119/2119 co-relation queries the response was YES. Maximal size of possible extension queue 4667. Compared 2652975 event pairs, 104854 based on Foata normal form. 64640/283376 useless extension candidates. Maximal degree in co-relation 120083. Up to 178304 conditions per place. [2025-02-06 18:44:49,592 INFO L140 encePairwiseOnDemand]: 111/137 looper letters, 88 selfloop transitions, 3 changer transitions 0/146 dead transitions. [2025-02-06 18:44:49,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 146 transitions, 501 flow [2025-02-06 18:44:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:44:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:44:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 346 transitions. [2025-02-06 18:44:49,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6313868613138686 [2025-02-06 18:44:49,593 INFO L175 Difference]: Start difference. First operand has 121 places, 137 transitions, 301 flow. Second operand 4 states and 346 transitions. [2025-02-06 18:44:49,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 146 transitions, 501 flow [2025-02-06 18:44:49,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 146 transitions, 501 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:44:49,598 INFO L231 Difference]: Finished difference. Result has 126 places, 119 transitions, 285 flow [2025-02-06 18:44:49,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=126, PETRI_TRANSITIONS=119} [2025-02-06 18:44:49,599 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 5 predicate places. [2025-02-06 18:44:49,599 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 119 transitions, 285 flow [2025-02-06 18:44:49,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-02-06 18:44:49,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:44:49,599 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:44:49,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:44:49,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:44:49,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:44:49,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1878054567, now seen corresponding path program 1 times [2025-02-06 18:44:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:44:49,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949345827] [2025-02-06 18:44:49,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:44:49,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:44:49,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:44:49,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:44:49,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:44:49,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:44:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:44:49,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:44:49,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949345827] [2025-02-06 18:44:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949345827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:44:49,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:44:49,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:44:49,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683317562] [2025-02-06 18:44:49,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:44:49,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:44:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:44:49,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:44:49,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:44:49,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 137 [2025-02-06 18:44:49,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 119 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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-02-06 18:44:49,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:44:49,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 137 [2025-02-06 18:44:49,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:00,724 INFO L124 PetriNetUnfolderBase]: 121206/195854 cut-off events. [2025-02-06 18:45:00,724 INFO L125 PetriNetUnfolderBase]: For 10719/10719 co-relation queries the response was YES. [2025-02-06 18:45:01,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376594 conditions, 195854 events. 121206/195854 cut-off events. For 10719/10719 co-relation queries the response was YES. Maximal size of possible extension queue 3766. Compared 1871760 event pairs, 16904 based on Foata normal form. 2940/187611 useless extension candidates. Maximal degree in co-relation 188084. Up to 115292 conditions per place. [2025-02-06 18:45:01,682 INFO L140 encePairwiseOnDemand]: 132/137 looper letters, 162 selfloop transitions, 6 changer transitions 0/223 dead transitions. [2025-02-06 18:45:01,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 223 transitions, 827 flow [2025-02-06 18:45:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:45:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:45:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 499 transitions. [2025-02-06 18:45:01,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6070559610705596 [2025-02-06 18:45:01,684 INFO L175 Difference]: Start difference. First operand has 126 places, 119 transitions, 285 flow. Second operand 6 states and 499 transitions. [2025-02-06 18:45:01,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 223 transitions, 827 flow [2025-02-06 18:45:01,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 223 transitions, 825 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:45:01,698 INFO L231 Difference]: Finished difference. Result has 129 places, 118 transitions, 291 flow [2025-02-06 18:45:01,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=129, PETRI_TRANSITIONS=118} [2025-02-06 18:45:01,699 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 8 predicate places. [2025-02-06 18:45:01,699 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 118 transitions, 291 flow [2025-02-06 18:45:01,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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-02-06 18:45:01,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:01,700 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:45:01,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:45:01,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:45:01,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1909850065, now seen corresponding path program 1 times [2025-02-06 18:45:01,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779138616] [2025-02-06 18:45:01,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:01,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:01,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:01,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:01,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:01,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:01,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779138616] [2025-02-06 18:45:01,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779138616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:01,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:01,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:45:01,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920541131] [2025-02-06 18:45:01,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:01,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:01,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:01,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:01,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:01,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 137 [2025-02-06 18:45:01,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 118 transitions, 291 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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-02-06 18:45:01,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:01,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 137 [2025-02-06 18:45:01,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand