./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fe12ce8951e45860142b9cebaa325eef531c18fa917882c03ee5396afb187f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:21:19,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:21:19,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:21:19,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:21:19,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:21:19,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:21:19,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:21:19,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:21:19,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:21:19,468 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:21:19,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:21:19,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:21:19,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:21:19,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:21:19,469 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:21:19,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:21:19,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:21:19,469 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:21:19,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:21:19,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:21:19,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:21:19,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:21:19,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:21:19,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:21:19,470 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:21:19,470 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:21:19,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:21:19,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:21:19,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:21:19,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:21:19,470 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:21:19,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:21:19,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:21:19,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:21:19,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:21:19,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:21:19,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:21:19,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:21:19,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:21:19,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:21:19,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:21:19,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:21:19,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:21:19,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:21:19,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:21:19,472 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fe12ce8951e45860142b9cebaa325eef531c18fa917882c03ee5396afb187f5 [2025-03-04 15:21:19,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:21:19,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:21:19,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:21:19,712 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:21:19,712 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:21:19,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i [2025-03-04 15:21:20,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/279e98bc6/b9823fead588482a8de90fecb9ee8c62/FLAG0d50b9944 [2025-03-04 15:21:21,166 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:21:21,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i [2025-03-04 15:21:21,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/279e98bc6/b9823fead588482a8de90fecb9ee8c62/FLAG0d50b9944 [2025-03-04 15:21:21,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/279e98bc6/b9823fead588482a8de90fecb9ee8c62 [2025-03-04 15:21:21,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:21:21,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:21:21,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:21:21,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:21:21,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:21:21,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29321aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21, skipping insertion in model container [2025-03-04 15:21:21,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:21:21,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:21:21,754 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:21:21,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:21:21,807 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:21:21,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21 WrapperNode [2025-03-04 15:21:21,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:21:21,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:21:21,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:21:21,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:21:21,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,831 INFO L138 Inliner]: procedures = 173, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-03-04 15:21:21,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:21:21,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:21:21,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:21:21,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:21:21,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,862 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-03-04 15:21:21,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,867 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:21:21,871 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:21:21,871 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:21:21,871 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:21:21,872 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21" (1/1) ... [2025-03-04 15:21:21,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:21:21,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:21:21,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:21:21,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:21:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:21:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:21:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:21:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:21:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:21:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:21:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:21:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:21:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:21:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:21:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:21:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:21:21,921 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:21:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:21:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:21:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:21:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:21:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:21:21,922 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:21:21,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:21:21,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:21:21,923 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:21:22,029 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:21:22,031 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:21:22,194 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:21:22,195 INFO L1325 $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-03-04 15:21:22,235 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:21:22,236 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:21:22,375 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:21:22,375 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:21:22,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:21:22 BoogieIcfgContainer [2025-03-04 15:21:22,376 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:21:22,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:21:22,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:21:22,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:21:22,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:21:21" (1/3) ... [2025-03-04 15:21:22,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f74795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:21:22, skipping insertion in model container [2025-03-04 15:21:22,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:21" (2/3) ... [2025-03-04 15:21:22,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f74795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:21:22, skipping insertion in model container [2025-03-04 15:21:22,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:21:22" (3/3) ... [2025-03-04 15:21:22,385 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_05-lockfuns_racefree.i [2025-03-04 15:21:22,398 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:21:22,399 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_05-lockfuns_racefree.i that has 2 procedures, 52 locations, 1 initial locations, 5 loop locations, and 8 error locations. [2025-03-04 15:21:22,399 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:21:22,436 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:21:22,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 61 transitions, 129 flow [2025-03-04 15:21:22,506 INFO L124 PetriNetUnfolderBase]: 11/77 cut-off events. [2025-03-04 15:21:22,508 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:21:22,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 77 events. 11/77 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 241 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 52. Up to 4 conditions per place. [2025-03-04 15:21:22,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 61 transitions, 129 flow [2025-03-04 15:21:22,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 60 transitions, 127 flow [2025-03-04 15:21:22,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:22,529 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;@7db30a57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:22,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 15:21:22,533 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:22,533 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:21:22,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:22,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:22,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:22,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:21:22,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:22,540 INFO L85 PathProgramCache]: Analyzing trace with hash 299428670, now seen corresponding path program 1 times [2025-03-04 15:21:22,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:22,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67653337] [2025-03-04 15:21:22,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:22,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:22,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:22,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:22,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:22,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:22,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:22,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67653337] [2025-03-04 15:21:22,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67653337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:22,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:22,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:22,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086174694] [2025-03-04 15:21:22,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:22,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:22,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:22,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:22,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-03-04 15:21:22,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:22,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:22,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-03-04 15:21:22,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:23,059 INFO L124 PetriNetUnfolderBase]: 169/454 cut-off events. [2025-03-04 15:21:23,059 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:21:23,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 454 events. 169/454 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2179 event pairs, 0 based on Foata normal form. 70/491 useless extension candidates. Maximal degree in co-relation 796. Up to 326 conditions per place. [2025-03-04 15:21:23,069 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 53 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-03-04 15:21:23,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 273 flow [2025-03-04 15:21:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2025-03-04 15:21:23,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6680327868852459 [2025-03-04 15:21:23,080 INFO L175 Difference]: Start difference. First operand has 55 places, 60 transitions, 127 flow. Second operand 4 states and 163 transitions. [2025-03-04 15:21:23,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 273 flow [2025-03-04 15:21:23,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:23,087 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 117 flow [2025-03-04 15:21:23,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-03-04 15:21:23,091 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2025-03-04 15:21:23,091 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 117 flow [2025-03-04 15:21:23,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:23,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:23,092 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:23,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:21:23,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:21:23,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:23,092 INFO L85 PathProgramCache]: Analyzing trace with hash -367309990, now seen corresponding path program 1 times [2025-03-04 15:21:23,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:23,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088178476] [2025-03-04 15:21:23,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:23,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:23,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:21:23,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:21:23,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:23,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:23,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:21:23,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:21:23,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:21:23,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:23,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:23,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:21:23,139 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:21:23,140 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-04 15:21:23,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-04 15:21:23,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-04 15:21:23,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-04 15:21:23,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-04 15:21:23,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-04 15:21:23,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-04 15:21:23,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-04 15:21:23,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-04 15:21:23,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-04 15:21:23,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-04 15:21:23,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-04 15:21:23,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-04 15:21:23,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:21:23,144 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 15:21:23,146 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:21:23,146 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:21:23,164 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:21:23,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 94 transitions, 204 flow [2025-03-04 15:21:23,190 INFO L124 PetriNetUnfolderBase]: 21/145 cut-off events. [2025-03-04 15:21:23,190 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:21:23,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 145 events. 21/145 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 539 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2025-03-04 15:21:23,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 94 transitions, 204 flow [2025-03-04 15:21:23,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 94 transitions, 204 flow [2025-03-04 15:21:23,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:23,194 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;@7db30a57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:23,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-04 15:21:23,196 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:23,196 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 15:21:23,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:23,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:23,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:23,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:23,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:23,197 INFO L85 PathProgramCache]: Analyzing trace with hash 389163131, now seen corresponding path program 1 times [2025-03-04 15:21:23,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:23,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739684295] [2025-03-04 15:21:23,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:23,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:23,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:23,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:23,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:23,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:23,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:23,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739684295] [2025-03-04 15:21:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739684295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:23,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:23,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683534939] [2025-03-04 15:21:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:23,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:23,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:23,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:23,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 94 [2025-03-04 15:21:23,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 94 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:23,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:23,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 94 [2025-03-04 15:21:23,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:24,313 INFO L124 PetriNetUnfolderBase]: 5891/12227 cut-off events. [2025-03-04 15:21:24,313 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-04 15:21:24,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21604 conditions, 12227 events. 5891/12227 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 101399 event pairs, 2782 based on Foata normal form. 1610/12724 useless extension candidates. Maximal degree in co-relation 1493. Up to 9257 conditions per place. [2025-03-04 15:21:24,390 INFO L140 encePairwiseOnDemand]: 74/94 looper letters, 73 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-03-04 15:21:24,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 109 transitions, 386 flow [2025-03-04 15:21:24,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:24,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2025-03-04 15:21:24,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6303191489361702 [2025-03-04 15:21:24,394 INFO L175 Difference]: Start difference. First operand has 83 places, 94 transitions, 204 flow. Second operand 4 states and 237 transitions. [2025-03-04 15:21:24,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 109 transitions, 386 flow [2025-03-04 15:21:24,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 109 transitions, 386 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:24,398 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 200 flow [2025-03-04 15:21:24,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2025-03-04 15:21:24,398 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 5 predicate places. [2025-03-04 15:21:24,399 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 200 flow [2025-03-04 15:21:24,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:24,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:24,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:24,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:21:24,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:24,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:24,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1945444006, now seen corresponding path program 1 times [2025-03-04 15:21:24,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:24,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471125362] [2025-03-04 15:21:24,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:24,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:24,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:21:24,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:21:24,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:24,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:24,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471125362] [2025-03-04 15:21:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471125362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:24,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:24,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:24,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232679713] [2025-03-04 15:21:24,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:24,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:24,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:24,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:24,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:24,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 94 [2025-03-04 15:21:24,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:24,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:24,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 94 [2025-03-04 15:21:24,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:25,507 INFO L124 PetriNetUnfolderBase]: 7335/15593 cut-off events. [2025-03-04 15:21:25,507 INFO L125 PetriNetUnfolderBase]: For 578/995 co-relation queries the response was YES. [2025-03-04 15:21:25,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27931 conditions, 15593 events. 7335/15593 cut-off events. For 578/995 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 137915 event pairs, 2168 based on Foata normal form. 259/14658 useless extension candidates. Maximal degree in co-relation 27819. Up to 7118 conditions per place. [2025-03-04 15:21:25,573 INFO L140 encePairwiseOnDemand]: 85/94 looper letters, 132 selfloop transitions, 12 changer transitions 0/179 dead transitions. [2025-03-04 15:21:25,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 179 transitions, 722 flow [2025-03-04 15:21:25,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:21:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:21:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 315 transitions. [2025-03-04 15:21:25,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6702127659574468 [2025-03-04 15:21:25,577 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 200 flow. Second operand 5 states and 315 transitions. [2025-03-04 15:21:25,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 179 transitions, 722 flow [2025-03-04 15:21:25,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 179 transitions, 718 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:21:25,582 INFO L231 Difference]: Finished difference. Result has 95 places, 93 transitions, 292 flow [2025-03-04 15:21:25,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=95, PETRI_TRANSITIONS=93} [2025-03-04 15:21:25,583 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 12 predicate places. [2025-03-04 15:21:25,583 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 93 transitions, 292 flow [2025-03-04 15:21:25,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:25,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:25,584 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:25,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:21:25,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:25,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:25,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1077164697, now seen corresponding path program 1 times [2025-03-04 15:21:25,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:25,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842064503] [2025-03-04 15:21:25,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:25,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:25,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:21:25,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:21:25,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:25,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:25,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:25,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842064503] [2025-03-04 15:21:25,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842064503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:25,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:25,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:21:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953284822] [2025-03-04 15:21:25,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:25,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:21:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:25,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:21:25,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:21:25,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 94 [2025-03-04 15:21:25,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 93 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:25,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:25,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 94 [2025-03-04 15:21:25,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:27,038 INFO L124 PetriNetUnfolderBase]: 7634/15248 cut-off events. [2025-03-04 15:21:27,039 INFO L125 PetriNetUnfolderBase]: For 4630/4630 co-relation queries the response was YES. [2025-03-04 15:21:27,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31812 conditions, 15248 events. 7634/15248 cut-off events. For 4630/4630 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 128965 event pairs, 1366 based on Foata normal form. 204/14366 useless extension candidates. Maximal degree in co-relation 24255. Up to 9379 conditions per place. [2025-03-04 15:21:27,103 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 142 selfloop transitions, 6 changer transitions 0/181 dead transitions. [2025-03-04 15:21:27,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 181 transitions, 846 flow [2025-03-04 15:21:27,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:21:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:21:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 326 transitions. [2025-03-04 15:21:27,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5780141843971631 [2025-03-04 15:21:27,105 INFO L175 Difference]: Start difference. First operand has 95 places, 93 transitions, 292 flow. Second operand 6 states and 326 transitions. [2025-03-04 15:21:27,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 181 transitions, 846 flow [2025-03-04 15:21:27,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 181 transitions, 846 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:27,117 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 300 flow [2025-03-04 15:21:27,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2025-03-04 15:21:27,120 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 16 predicate places. [2025-03-04 15:21:27,121 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 300 flow [2025-03-04 15:21:27,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:27,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:27,121 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:21:27,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:21:27,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:27,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash 967633111, now seen corresponding path program 1 times [2025-03-04 15:21:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:27,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575359763] [2025-03-04 15:21:27,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:27,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:21:27,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:21:27,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:27,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:27,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:27,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575359763] [2025-03-04 15:21:27,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575359763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:27,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:27,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:21:27,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77512530] [2025-03-04 15:21:27,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:27,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:27,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:27,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:27,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 94 [2025-03-04 15:21:27,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:27,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:27,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 94 [2025-03-04 15:21:27,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:28,039 INFO L124 PetriNetUnfolderBase]: 7271/14420 cut-off events. [2025-03-04 15:21:28,040 INFO L125 PetriNetUnfolderBase]: For 5358/5358 co-relation queries the response was YES. [2025-03-04 15:21:28,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30751 conditions, 14420 events. 7271/14420 cut-off events. For 5358/5358 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 120517 event pairs, 1551 based on Foata normal form. 212/13838 useless extension candidates. Maximal degree in co-relation 23301. Up to 10013 conditions per place. [2025-03-04 15:21:28,110 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 115 selfloop transitions, 6 changer transitions 0/154 dead transitions. [2025-03-04 15:21:28,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 154 transitions, 728 flow [2025-03-04 15:21:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2025-03-04 15:21:28,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6143617021276596 [2025-03-04 15:21:28,112 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 300 flow. Second operand 4 states and 231 transitions. [2025-03-04 15:21:28,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 154 transitions, 728 flow [2025-03-04 15:21:28,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 154 transitions, 712 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:21:28,126 INFO L231 Difference]: Finished difference. Result has 97 places, 92 transitions, 300 flow [2025-03-04 15:21:28,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=97, PETRI_TRANSITIONS=92} [2025-03-04 15:21:28,127 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 14 predicate places. [2025-03-04 15:21:28,127 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 92 transitions, 300 flow [2025-03-04 15:21:28,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:28,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:28,128 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 15:21:28,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:21:28,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:28,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:28,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2112470706, now seen corresponding path program 1 times [2025-03-04 15:21:28,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:28,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718442429] [2025-03-04 15:21:28,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:28,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:28,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:21:28,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:21:28,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:28,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:28,142 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:21:28,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:21:28,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:21:28,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:28,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:28,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:21:28,160 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:21:28,160 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-04 15:21:28,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-04 15:21:28,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-04 15:21:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-04 15:21:28,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:21:28,162 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 15:21:28,162 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:21:28,162 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:21:28,183 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:21:28,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 127 transitions, 281 flow [2025-03-04 15:21:28,204 INFO L124 PetriNetUnfolderBase]: 34/232 cut-off events. [2025-03-04 15:21:28,204 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 15:21:28,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 232 events. 34/232 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 949 event pairs, 1 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 160. Up to 12 conditions per place. [2025-03-04 15:21:28,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 127 transitions, 281 flow [2025-03-04 15:21:28,207 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 127 transitions, 281 flow [2025-03-04 15:21:28,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:28,209 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;@7db30a57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:28,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 15:21:28,211 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:28,211 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 15:21:28,211 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:28,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:28,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:28,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:21:28,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash 510389657, now seen corresponding path program 1 times [2025-03-04 15:21:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:28,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479839670] [2025-03-04 15:21:28,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:28,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:28,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:28,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:28,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:28,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:28,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479839670] [2025-03-04 15:21:28,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479839670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:28,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:28,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:28,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449116999] [2025-03-04 15:21:28,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:28,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:28,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:28,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:28,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:28,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 127 [2025-03-04 15:21:28,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 127 transitions, 281 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:28,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:28,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 127 [2025-03-04 15:21:28,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:40,191 INFO L124 PetriNetUnfolderBase]: 129214/229364 cut-off events. [2025-03-04 15:21:40,191 INFO L125 PetriNetUnfolderBase]: For 2337/2337 co-relation queries the response was YES. [2025-03-04 15:21:40,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409218 conditions, 229364 events. 129214/229364 cut-off events. For 2337/2337 co-relation queries the response was YES. Maximal size of possible extension queue 4633. Compared 2410743 event pairs, 84202 based on Foata normal form. 32680/243032 useless extension candidates. Maximal degree in co-relation 22392. Up to 178304 conditions per place. [2025-03-04 15:21:41,466 INFO L140 encePairwiseOnDemand]: 101/127 looper letters, 88 selfloop transitions, 3 changer transitions 0/136 dead transitions. [2025-03-04 15:21:41,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 136 transitions, 481 flow [2025-03-04 15:21:41,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 306 transitions. [2025-03-04 15:21:41,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6023622047244095 [2025-03-04 15:21:41,467 INFO L175 Difference]: Start difference. First operand has 111 places, 127 transitions, 281 flow. Second operand 4 states and 306 transitions. [2025-03-04 15:21:41,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 136 transitions, 481 flow [2025-03-04 15:21:41,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 136 transitions, 481 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:41,472 INFO L231 Difference]: Finished difference. Result has 116 places, 109 transitions, 265 flow [2025-03-04 15:21:41,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=265, PETRI_PLACES=116, PETRI_TRANSITIONS=109} [2025-03-04 15:21:41,473 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 5 predicate places. [2025-03-04 15:21:41,473 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 109 transitions, 265 flow [2025-03-04 15:21:41,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:41,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:41,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:41,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:21:41,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:21:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1777346952, now seen corresponding path program 1 times [2025-03-04 15:21:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436813872] [2025-03-04 15:21:41,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:41,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:21:41,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:21:41,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:41,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:41,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:41,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436813872] [2025-03-04 15:21:41,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436813872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:41,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:41,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:41,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276085559] [2025-03-04 15:21:41,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:41,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:41,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:41,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:41,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:41,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 127 [2025-03-04 15:21:41,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 109 transitions, 265 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:41,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:41,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 127 [2025-03-04 15:21:41,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand