./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.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_37-indirect_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:45:37,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:45:37,870 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:45:37,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:45:37,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:45:37,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:45:37,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:45:37,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:45:37,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:45:37,896 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:45:37,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:45:37,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:45:37,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:45:37,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:45:37,897 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:45:37,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:45:37,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:45:37,897 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:45:37,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:45:37,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:45:37,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:45:37,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:45:37,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:45:37,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:45:37,898 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:45:37,898 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:45:37,898 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:45:37,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:45:37,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:45:37,898 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:45:37,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:45:37,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:45:37,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:45:37,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:45:37,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:45:37,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:45:37,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:45:37,899 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:45:37,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:45:37,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:45:37,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:45:37,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:45:37,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:45:37,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:45:37,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:45:37,900 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 -> 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 [2025-02-06 18:45:38,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:45:38,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:45:38,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:45:38,175 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:45:38,175 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:45:38,177 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_37-indirect_racing.i [2025-02-06 18:45:39,428 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f0b5f3b5/24d029e6c6054107b37cbf7d4397482a/FLAG4c504530c [2025-02-06 18:45:39,773 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:45:39,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2025-02-06 18:45:39,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f0b5f3b5/24d029e6c6054107b37cbf7d4397482a/FLAG4c504530c [2025-02-06 18:45:39,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f0b5f3b5/24d029e6c6054107b37cbf7d4397482a [2025-02-06 18:45:39,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:45:39,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:45:39,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:45:39,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:45:39,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:45:39,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:45:39" (1/1) ... [2025-02-06 18:45:39,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f99718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:39, skipping insertion in model container [2025-02-06 18:45:39,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:45:39" (1/1) ... [2025-02-06 18:45:39,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:45:40,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:45:40,121 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:45:40,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:45:40,209 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:45:40,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:40 WrapperNode [2025-02-06 18:45:40,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:45:40,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:45:40,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:45:40,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:45:40,217 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:45:40" (1/1) ... [2025-02-06 18:45:40,230 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:45:40" (1/1) ... [2025-02-06 18:45:40,256 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2025-02-06 18:45:40,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:45:40,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:45:40,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:45:40,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:45:40,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:40" (1/1) ... [2025-02-06 18:45:40,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:40" (1/1) ... [2025-02-06 18:45:40,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:40" (1/1) ... [2025-02-06 18:45:40,291 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 5, 6, 5, 2]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 5, 0]. The 3 writes are split as follows [0, 0, 2, 0, 1]. [2025-02-06 18:45:40,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:40" (1/1) ... [2025-02-06 18:45:40,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:40" (1/1) ... [2025-02-06 18:45:40,304 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:40" (1/1) ... [2025-02-06 18:45:40,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:40" (1/1) ... [2025-02-06 18:45:40,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:40" (1/1) ... [2025-02-06 18:45:40,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:40" (1/1) ... [2025-02-06 18:45:40,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:45:40,317 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:45:40,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:45:40,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:45:40,318 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:40" (1/1) ... [2025-02-06 18:45:40,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:45:40,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:45:40,360 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:45:40,363 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:45:40,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:45:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:45:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:45:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 18:45:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 18:45:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:45:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:45:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:45:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 18:45:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 18:45:40,387 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 18:45:40,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:45:40,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:45:40,387 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 18:45:40,387 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 18:45:40,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:45:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:45:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:45:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:45:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 18:45:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 18:45:40,389 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 18:45:40,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:45:40,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:45:40,390 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:45:40,523 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:45:40,525 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:45:40,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 18:45:40,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 18:45:40,769 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:45:40,772 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:45:40,908 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:45:40,909 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:45:40,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:45:40 BoogieIcfgContainer [2025-02-06 18:45:40,909 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:45:40,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:45:40,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:45:40,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:45:40,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:45:39" (1/3) ... [2025-02-06 18:45:40,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a279c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:45:40, skipping insertion in model container [2025-02-06 18:45:40,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:40" (2/3) ... [2025-02-06 18:45:40,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a279c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:45:40, skipping insertion in model container [2025-02-06 18:45:40,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:45:40" (3/3) ... [2025-02-06 18:45:40,917 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_37-indirect_racing.i [2025-02-06 18:45:40,934 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:45:40,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_37-indirect_racing.i that has 2 procedures, 51 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-02-06 18:45:40,937 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:45:40,985 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 18:45:41,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 60 transitions, 127 flow [2025-02-06 18:45:41,063 INFO L124 PetriNetUnfolderBase]: 11/73 cut-off events. [2025-02-06 18:45:41,065 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:45:41,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 73 events. 11/73 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 211 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 51. Up to 4 conditions per place. [2025-02-06 18:45:41,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 60 transitions, 127 flow [2025-02-06 18:45:41,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 59 transitions, 125 flow [2025-02-06 18:45:41,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:41,100 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;@3b532e3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:41,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-06 18:45:41,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:41,109 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-06 18:45:41,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:41,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:41,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:41,110 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:45:41,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:41,114 INFO L85 PathProgramCache]: Analyzing trace with hash 305329781, now seen corresponding path program 1 times [2025-02-06 18:45:41,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:41,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574369205] [2025-02-06 18:45:41,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:41,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:41,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:41,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:41,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:41,418 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:41,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:41,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574369205] [2025-02-06 18:45:41,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574369205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:41,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:41,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:41,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957306276] [2025-02-06 18:45:41,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:41,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:41,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:41,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:41,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-02-06 18:45:41,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 59 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:41,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:41,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-02-06 18:45:41,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:41,698 INFO L124 PetriNetUnfolderBase]: 99/363 cut-off events. [2025-02-06 18:45:41,698 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:45:41,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 363 events. 99/363 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1801 event pairs, 70 based on Foata normal form. 96/414 useless extension candidates. Maximal degree in co-relation 571. Up to 186 conditions per place. [2025-02-06 18:45:41,704 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 43 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2025-02-06 18:45:41,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 243 flow [2025-02-06 18:45:41,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2025-02-06 18:45:41,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7208333333333333 [2025-02-06 18:45:41,720 INFO L175 Difference]: Start difference. First operand has 54 places, 59 transitions, 125 flow. Second operand 4 states and 173 transitions. [2025-02-06 18:45:41,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 243 flow [2025-02-06 18:45:41,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:41,728 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 115 flow [2025-02-06 18:45:41,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-02-06 18:45:41,736 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-02-06 18:45:41,736 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 115 flow [2025-02-06 18:45:41,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:41,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:41,737 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:41,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:45:41,737 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:45:41,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash -660979600, now seen corresponding path program 1 times [2025-02-06 18:45:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915925254] [2025-02-06 18:45:41,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:41,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:45:41,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:45:41,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:41,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:41,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:45:41,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:45:41,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:45:41,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:41,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:41,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:45:41,824 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:45:41,826 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-06 18:45:41,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-06 18:45:41,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-06 18:45:41,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-06 18:45:41,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-06 18:45:41,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-06 18:45:41,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-06 18:45:41,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-06 18:45:41,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-06 18:45:41,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-06 18:45:41,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-06 18:45:41,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-06 18:45:41,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-06 18:45:41,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:45:41,830 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 18:45:41,832 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:45:41,833 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 18:45:41,863 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 18:45:41,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 95 transitions, 206 flow [2025-02-06 18:45:41,892 INFO L124 PetriNetUnfolderBase]: 21/140 cut-off events. [2025-02-06 18:45:41,893 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 18:45:41,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 140 events. 21/140 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 519 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2025-02-06 18:45:41,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 95 transitions, 206 flow [2025-02-06 18:45:41,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 95 transitions, 206 flow [2025-02-06 18:45:41,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:41,900 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;@3b532e3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:41,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-06 18:45:41,904 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:41,906 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-06 18:45:41,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:41,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:41,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:41,906 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:45:41,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash 396020469, now seen corresponding path program 1 times [2025-02-06 18:45:41,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:41,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150279056] [2025-02-06 18:45:41,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:41,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:41,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:41,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:41,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:41,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:42,015 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:42,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:42,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150279056] [2025-02-06 18:45:42,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150279056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:42,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:42,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989791311] [2025-02-06 18:45:42,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:42,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:42,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:42,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:42,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:42,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 95 [2025-02-06 18:45:42,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 95 transitions, 206 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:45:42,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:42,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 95 [2025-02-06 18:45:42,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:43,005 INFO L124 PetriNetUnfolderBase]: 3220/7446 cut-off events. [2025-02-06 18:45:43,006 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-06 18:45:43,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12657 conditions, 7446 events. 3220/7446 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 64228 event pairs, 3024 based on Foata normal form. 2092/8636 useless extension candidates. Maximal degree in co-relation 10835. Up to 5107 conditions per place. [2025-02-06 18:45:43,068 INFO L140 encePairwiseOnDemand]: 75/95 looper letters, 61 selfloop transitions, 3 changer transitions 0/106 dead transitions. [2025-02-06 18:45:43,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 106 transitions, 356 flow [2025-02-06 18:45:43,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:43,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2025-02-06 18:45:43,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6868421052631579 [2025-02-06 18:45:43,074 INFO L175 Difference]: Start difference. First operand has 84 places, 95 transitions, 206 flow. Second operand 4 states and 261 transitions. [2025-02-06 18:45:43,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 106 transitions, 356 flow [2025-02-06 18:45:43,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 106 transitions, 356 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:43,080 INFO L231 Difference]: Finished difference. Result has 89 places, 83 transitions, 202 flow [2025-02-06 18:45:43,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=89, PETRI_TRANSITIONS=83} [2025-02-06 18:45:43,081 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 5 predicate places. [2025-02-06 18:45:43,081 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 83 transitions, 202 flow [2025-02-06 18:45:43,081 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:45:43,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:43,082 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:43,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:45:43,082 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:45:43,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:43,083 INFO L85 PathProgramCache]: Analyzing trace with hash 20767000, now seen corresponding path program 1 times [2025-02-06 18:45:43,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:43,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539842643] [2025-02-06 18:45:43,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:43,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:43,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:45:43,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:45:43,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:43,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:43,217 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:43,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:43,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539842643] [2025-02-06 18:45:43,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539842643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:43,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:43,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:45:43,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537423169] [2025-02-06 18:45:43,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:43,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:45:43,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:43,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:45:43,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:45:43,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 95 [2025-02-06 18:45:43,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 83 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:43,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:43,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 95 [2025-02-06 18:45:43,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:44,145 INFO L124 PetriNetUnfolderBase]: 2939/6152 cut-off events. [2025-02-06 18:45:44,145 INFO L125 PetriNetUnfolderBase]: For 544/544 co-relation queries the response was YES. [2025-02-06 18:45:44,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11569 conditions, 6152 events. 2939/6152 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 49162 event pairs, 634 based on Foata normal form. 144/5779 useless extension candidates. Maximal degree in co-relation 10438. Up to 2719 conditions per place. [2025-02-06 18:45:44,187 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 101 selfloop transitions, 6 changer transitions 0/149 dead transitions. [2025-02-06 18:45:44,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 149 transitions, 546 flow [2025-02-06 18:45:44,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:45:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:45:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 360 transitions. [2025-02-06 18:45:44,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2025-02-06 18:45:44,191 INFO L175 Difference]: Start difference. First operand has 89 places, 83 transitions, 202 flow. Second operand 6 states and 360 transitions. [2025-02-06 18:45:44,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 149 transitions, 546 flow [2025-02-06 18:45:44,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 149 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:45:44,199 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 208 flow [2025-02-06 18:45:44,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2025-02-06 18:45:44,201 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 8 predicate places. [2025-02-06 18:45:44,201 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 208 flow [2025-02-06 18:45:44,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:44,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:44,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:44,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:45:44,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:45:44,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1298749415, now seen corresponding path program 1 times [2025-02-06 18:45:44,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:44,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629036658] [2025-02-06 18:45:44,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:44,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:44,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:44,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:44,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:44,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:44,343 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:44,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:44,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629036658] [2025-02-06 18:45:44,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629036658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:44,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:44,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:44,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149089434] [2025-02-06 18:45:44,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:44,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:44,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:44,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:44,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:44,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 95 [2025-02-06 18:45:44,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:44,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:44,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 95 [2025-02-06 18:45:44,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:45,005 INFO L124 PetriNetUnfolderBase]: 2816/6308 cut-off events. [2025-02-06 18:45:45,005 INFO L125 PetriNetUnfolderBase]: For 1142/1303 co-relation queries the response was YES. [2025-02-06 18:45:45,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11650 conditions, 6308 events. 2816/6308 cut-off events. For 1142/1303 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 52086 event pairs, 911 based on Foata normal form. 121/5849 useless extension candidates. Maximal degree in co-relation 9132. Up to 3985 conditions per place. [2025-02-06 18:45:45,046 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 83 selfloop transitions, 6 changer transitions 0/132 dead transitions. [2025-02-06 18:45:45,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 132 transitions, 531 flow [2025-02-06 18:45:45,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:45:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:45:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2025-02-06 18:45:45,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6421052631578947 [2025-02-06 18:45:45,048 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 208 flow. Second operand 5 states and 305 transitions. [2025-02-06 18:45:45,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 132 transitions, 531 flow [2025-02-06 18:45:45,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 132 transitions, 508 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 18:45:45,055 INFO L231 Difference]: Finished difference. Result has 95 places, 87 transitions, 240 flow [2025-02-06 18:45:45,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=95, PETRI_TRANSITIONS=87} [2025-02-06 18:45:45,057 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 11 predicate places. [2025-02-06 18:45:45,057 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 87 transitions, 240 flow [2025-02-06 18:45:45,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:45,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:45,058 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:45:45,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:45:45,058 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-02-06 18:45:45,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:45,059 INFO L85 PathProgramCache]: Analyzing trace with hash 643777342, now seen corresponding path program 1 times [2025-02-06 18:45:45,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:45,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481443820] [2025-02-06 18:45:45,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:45,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:45,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:45,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:45,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:45,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:45,117 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:45,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:45,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481443820] [2025-02-06 18:45:45,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481443820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:45,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:45,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:45:45,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564447815] [2025-02-06 18:45:45,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:45,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:45,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:45,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:45,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:45,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 95 [2025-02-06 18:45:45,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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:45,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:45,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 95 [2025-02-06 18:45:45,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:45,691 INFO L124 PetriNetUnfolderBase]: 2829/5886 cut-off events. [2025-02-06 18:45:45,691 INFO L125 PetriNetUnfolderBase]: For 1479/1479 co-relation queries the response was YES. [2025-02-06 18:45:45,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11745 conditions, 5886 events. 2829/5886 cut-off events. For 1479/1479 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 46784 event pairs, 397 based on Foata normal form. 152/5763 useless extension candidates. Maximal degree in co-relation 10921. Up to 3339 conditions per place. [2025-02-06 18:45:45,724 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 93 selfloop transitions, 6 changer transitions 0/141 dead transitions. [2025-02-06 18:45:45,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 141 transitions, 590 flow [2025-02-06 18:45:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-02-06 18:45:45,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6605263157894737 [2025-02-06 18:45:45,726 INFO L175 Difference]: Start difference. First operand has 95 places, 87 transitions, 240 flow. Second operand 4 states and 251 transitions. [2025-02-06 18:45:45,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 141 transitions, 590 flow [2025-02-06 18:45:45,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 141 transitions, 586 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 18:45:45,737 INFO L231 Difference]: Finished difference. Result has 97 places, 87 transitions, 252 flow [2025-02-06 18:45:45,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=97, PETRI_TRANSITIONS=87} [2025-02-06 18:45:45,738 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 13 predicate places. [2025-02-06 18:45:45,738 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 87 transitions, 252 flow [2025-02-06 18:45:45,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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:45,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:45,738 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-06 18:45:45,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:45:45,738 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:45:45,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash 194748301, now seen corresponding path program 1 times [2025-02-06 18:45:45,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:45,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708438431] [2025-02-06 18:45:45,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:45,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:45,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:45:45,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:45:45,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:45,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:45,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:45:45,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:45:45,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:45:45,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:45,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:45,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:45:45,776 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:45:45,777 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-06 18:45:45,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-02-06 18:45:45,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-02-06 18:45:45,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-02-06 18:45:45,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-02-06 18:45:45,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-02-06 18:45:45,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-02-06 18:45:45,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-02-06 18:45:45,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-02-06 18:45:45,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-02-06 18:45:45,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-02-06 18:45:45,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-02-06 18:45:45,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-02-06 18:45:45,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-02-06 18:45:45,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-02-06 18:45:45,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-02-06 18:45:45,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-02-06 18:45:45,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:45:45,779 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 18:45:45,780 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:45:45,780 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 18:45:45,806 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 18:45:45,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 130 transitions, 287 flow [2025-02-06 18:45:45,830 INFO L124 PetriNetUnfolderBase]: 34/226 cut-off events. [2025-02-06 18:45:45,831 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 18:45:45,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 226 events. 34/226 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 950 event pairs, 1 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 155. Up to 12 conditions per place. [2025-02-06 18:45:45,832 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 130 transitions, 287 flow [2025-02-06 18:45:45,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 130 transitions, 287 flow [2025-02-06 18:45:45,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:45,836 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;@3b532e3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:45,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-06 18:45:45,839 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:45,839 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-06 18:45:45,841 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:45,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:45,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:45,842 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:45:45,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash 520111832, now seen corresponding path program 1 times [2025-02-06 18:45:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:45,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520001396] [2025-02-06 18:45:45,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:45,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:45,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:45,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:45,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:45,886 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:45,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:45,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520001396] [2025-02-06 18:45:45,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520001396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:45,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:45,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108046555] [2025-02-06 18:45:45,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:45,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:45,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:45,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:45,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:45,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 130 [2025-02-06 18:45:45,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 130 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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:45,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:45,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 130 [2025-02-06 18:45:45,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:53,266 INFO L124 PetriNetUnfolderBase]: 61547/114543 cut-off events. [2025-02-06 18:45:53,266 INFO L125 PetriNetUnfolderBase]: For 1911/1911 co-relation queries the response was YES. [2025-02-06 18:45:53,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201318 conditions, 114543 events. 61547/114543 cut-off events. For 1911/1911 co-relation queries the response was YES. Maximal size of possible extension queue 2819. Compared 1225974 event pairs, 39796 based on Foata normal form. 37036/139583 useless extension candidates. Maximal degree in co-relation 13447. Up to 85613 conditions per place. [2025-02-06 18:45:53,923 INFO L140 encePairwiseOnDemand]: 104/130 looper letters, 74 selfloop transitions, 3 changer transitions 0/135 dead transitions. [2025-02-06 18:45:53,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 135 transitions, 451 flow [2025-02-06 18:45:53,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 344 transitions. [2025-02-06 18:45:53,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2025-02-06 18:45:53,926 INFO L175 Difference]: Start difference. First operand has 114 places, 130 transitions, 287 flow. Second operand 4 states and 344 transitions. [2025-02-06 18:45:53,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 135 transitions, 451 flow [2025-02-06 18:45:53,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 135 transitions, 451 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:53,934 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 271 flow [2025-02-06 18:45:53,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2025-02-06 18:45:53,936 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 5 predicate places. [2025-02-06 18:45:53,936 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 271 flow [2025-02-06 18:45:53,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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:53,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:53,936 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:53,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:45:53,937 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:45:53,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1070454520, now seen corresponding path program 1 times [2025-02-06 18:45:53,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:53,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72917848] [2025-02-06 18:45:53,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:53,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:53,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:45:53,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:45:53,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:53,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:54,029 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:54,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:54,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72917848] [2025-02-06 18:45:54,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72917848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:54,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:54,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:45:54,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700771362] [2025-02-06 18:45:54,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:54,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:45:54,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:54,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:45:54,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:45:54,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 130 [2025-02-06 18:45:54,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 112 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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:54,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:54,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 130 [2025-02-06 18:45:54,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:46:00,577 INFO L124 PetriNetUnfolderBase]: 56228/99350 cut-off events. [2025-02-06 18:46:00,578 INFO L125 PetriNetUnfolderBase]: For 8809/8809 co-relation queries the response was YES. [2025-02-06 18:46:00,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186378 conditions, 99350 events. 56228/99350 cut-off events. For 8809/8809 co-relation queries the response was YES. Maximal size of possible extension queue 2321. Compared 998419 event pairs, 7896 based on Foata normal form. 1872/94241 useless extension candidates. Maximal degree in co-relation 16426. Up to 45544 conditions per place. [2025-02-06 18:46:01,046 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 136 selfloop transitions, 6 changer transitions 0/200 dead transitions. [2025-02-06 18:46:01,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 200 transitions, 729 flow [2025-02-06 18:46:01,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:46:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:46:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2025-02-06 18:46:01,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6294871794871795 [2025-02-06 18:46:01,048 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 271 flow. Second operand 6 states and 491 transitions. [2025-02-06 18:46:01,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 200 transitions, 729 flow [2025-02-06 18:46:01,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 200 transitions, 727 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:46:01,059 INFO L231 Difference]: Finished difference. Result has 122 places, 111 transitions, 277 flow [2025-02-06 18:46:01,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=122, PETRI_TRANSITIONS=111} [2025-02-06 18:46:01,060 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 8 predicate places. [2025-02-06 18:46:01,060 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 111 transitions, 277 flow [2025-02-06 18:46:01,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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:46:01,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:46:01,060 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:46:01,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:46:01,061 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:46:01,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:46:01,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1175647776, now seen corresponding path program 1 times [2025-02-06 18:46:01,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:46:01,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504257683] [2025-02-06 18:46:01,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:46:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:46:01,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:46:01,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:46:01,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:46:01,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:46:01,110 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:46:01,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:46:01,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504257683] [2025-02-06 18:46:01,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504257683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:46:01,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:46:01,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:46:01,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975954844] [2025-02-06 18:46:01,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:46:01,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:46:01,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:46:01,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:46:01,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:46:01,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 130 [2025-02-06 18:46:01,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 111 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 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:46:01,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:46:01,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 130 [2025-02-06 18:46:01,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:46:06,734 INFO L124 PetriNetUnfolderBase]: 51212/87846 cut-off events. [2025-02-06 18:46:06,734 INFO L125 PetriNetUnfolderBase]: For 14661/14661 co-relation queries the response was YES. [2025-02-06 18:46:06,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171755 conditions, 87846 events. 51212/87846 cut-off events. For 14661/14661 co-relation queries the response was YES. Maximal size of possible extension queue 2071. Compared 839420 event pairs, 6325 based on Foata normal form. 1872/85361 useless extension candidates. Maximal degree in co-relation 66438. Up to 52455 conditions per place. [2025-02-06 18:46:07,205 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 113 selfloop transitions, 6 changer transitions 0/177 dead transitions. [2025-02-06 18:46:07,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 177 transitions, 645 flow [2025-02-06 18:46:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:46:07,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:46:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 350 transitions. [2025-02-06 18:46:07,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2025-02-06 18:46:07,207 INFO L175 Difference]: Start difference. First operand has 122 places, 111 transitions, 277 flow. Second operand 4 states and 350 transitions. [2025-02-06 18:46:07,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 177 transitions, 645 flow [2025-02-06 18:46:07,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 177 transitions, 629 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-06 18:46:07,256 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 277 flow [2025-02-06 18:46:07,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2025-02-06 18:46:07,257 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 6 predicate places. [2025-02-06 18:46:07,257 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 277 flow [2025-02-06 18:46:07,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 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:46:07,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:46:07,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:46:07,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:46:07,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:46:07,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:46:07,258 INFO L85 PathProgramCache]: Analyzing trace with hash 635383676, now seen corresponding path program 1 times [2025-02-06 18:46:07,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:46:07,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151384766] [2025-02-06 18:46:07,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:46:07,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:46:07,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:46:07,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:46:07,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:46:07,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:46:07,544 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:46:07,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:46:07,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151384766] [2025-02-06 18:46:07,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151384766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:46:07,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:46:07,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:46:07,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586708123] [2025-02-06 18:46:07,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:46:07,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:46:07,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:46:07,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:46:07,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:46:07,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 130 [2025-02-06 18:46:07,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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:46:07,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:46:07,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 130 [2025-02-06 18:46:07,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:46:13,264 INFO L124 PetriNetUnfolderBase]: 56914/102777 cut-off events. [2025-02-06 18:46:13,265 INFO L125 PetriNetUnfolderBase]: For 20196/20196 co-relation queries the response was YES. [2025-02-06 18:46:13,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192676 conditions, 102777 events. 56914/102777 cut-off events. For 20196/20196 co-relation queries the response was YES. Maximal size of possible extension queue 2634. Compared 1048963 event pairs, 23513 based on Foata normal form. 1497/95807 useless extension candidates. Maximal degree in co-relation 127944. Up to 73664 conditions per place. [2025-02-06 18:46:13,729 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 122 selfloop transitions, 8 changer transitions 0/188 dead transitions. [2025-02-06 18:46:13,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 188 transitions, 765 flow [2025-02-06 18:46:13,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:46:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:46:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2025-02-06 18:46:13,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2025-02-06 18:46:13,732 INFO L175 Difference]: Start difference. First operand has 120 places, 111 transitions, 277 flow. Second operand 5 states and 425 transitions. [2025-02-06 18:46:13,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 188 transitions, 765 flow [2025-02-06 18:46:13,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 188 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:46:13,737 INFO L231 Difference]: Finished difference. Result has 125 places, 118 transitions, 330 flow [2025-02-06 18:46:13,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=125, PETRI_TRANSITIONS=118} [2025-02-06 18:46:13,738 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 11 predicate places. [2025-02-06 18:46:13,738 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 118 transitions, 330 flow [2025-02-06 18:46:13,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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:46:13,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:46:13,738 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:46:13,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:46:13,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:46:13,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:46:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash -146905444, now seen corresponding path program 1 times [2025-02-06 18:46:13,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:46:13,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492212980] [2025-02-06 18:46:13,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:46:13,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:46:13,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 18:46:13,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:46:13,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:46:13,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:46:13,847 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:46:13,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:46:13,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492212980] [2025-02-06 18:46:13,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492212980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:46:13,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:46:13,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:46:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601500990] [2025-02-06 18:46:13,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:46:13,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:46:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:46:13,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:46:13,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:46:13,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 130 [2025-02-06 18:46:13,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 118 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 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:46:13,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:46:13,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 130 [2025-02-06 18:46:13,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand