./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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_20-callback_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:05:32,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:05:32,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:05:32,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:05:32,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:05:32,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:05:32,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:05:32,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:05:32,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:05:32,657 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:05:32,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:05:32,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:05:32,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:05:32,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:05:32,658 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:05:32,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:05:32,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:05:32,659 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:05:32,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:05:32,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:05:32,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:05:32,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:05:32,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:05:32,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:05:32,660 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:05:32,660 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:05:32,660 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:05:32,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:05:32,660 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:05:32,660 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:05:32,660 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:05:32,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:05:32,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:05:32,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:05:32,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:05:32,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:05:32,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:05:32,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:05:32,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:05:32,661 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:05:32,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:05:32,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:05:32,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:05:32,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:05:32,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:05:32,662 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 -> 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f [2025-02-08 14:05:32,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:05:32,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:05:32,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:05:32,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:05:32,921 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:05:32,921 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_20-callback_racefree.i [2025-02-08 14:05:34,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc7063d63/0854ad9e2b2444cda3532889f23921b4/FLAGf12e8c514 [2025-02-08 14:05:34,427 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:05:34,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2025-02-08 14:05:34,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc7063d63/0854ad9e2b2444cda3532889f23921b4/FLAGf12e8c514 [2025-02-08 14:05:34,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc7063d63/0854ad9e2b2444cda3532889f23921b4 [2025-02-08 14:05:34,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:05:34,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:05:34,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:05:34,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:05:34,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:05:34,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:05:34" (1/1) ... [2025-02-08 14:05:34,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702d0418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:34, skipping insertion in model container [2025-02-08 14:05:34,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:05:34" (1/1) ... [2025-02-08 14:05:34,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:05:34,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:05:35,023 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:05:35,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:05:35,111 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:05:35,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35 WrapperNode [2025-02-08 14:05:35,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:05:35,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:05:35,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:05:35,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:05:35,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,155 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 194 [2025-02-08 14:05:35,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:05:35,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:05:35,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:05:35,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:05:35,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,183 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-02-08 14:05:35,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:05:35,197 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:05:35,197 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:05:35,197 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:05:35,198 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:05:35,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:05:35,226 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-08 14:05:35,233 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-08 14:05:35,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:05:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:05:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:05:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:05:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:05:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:05:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:05:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:05:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 14:05:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:05:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:05:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 14:05:35,254 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 14:05:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:05:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:05:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:05:35,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:05:35,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 14:05:35,255 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 14:05:35,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:05:35,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:05:35,256 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:05:35,355 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:05:35,357 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:05:35,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701: assume { :end_inline_##fun~~TO~int } true;assume -2147483648 <= foo_#t~ret4#1 && foo_#t~ret4#1 <= 2147483647; [2025-02-08 14:05:35,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-1: havoc ##fun~~TO~int_#in~#fp#1.base, ##fun~~TO~int_#in~#fp#1.offset; [2025-02-08 14:05:35,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-2: havoc ##fun~~TO~int_#t~ret49#1; [2025-02-08 14:05:35,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-3: foo_#t~ret4#1 := ##fun~~TO~int_#res#1; [2025-02-08 14:05:35,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 14:05:35,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 14:05:35,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-2: havoc ##fun~~TO~int_#t~ret49#1; [2025-02-08 14:05:35,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-3: ##fun~~TO~int_#res#1 := ##fun~~TO~int_#t~ret49#1; [2025-02-08 14:05:35,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-4: assume { :end_inline_bar } true;assume -2147483648 <= ##fun~~TO~int_#t~ret49#1 && ##fun~~TO~int_#t~ret49#1 <= 2147483647; [2025-02-08 14:05:35,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-5: havoc bar_#t~ret6#1, bar_#t~ret7#1, bar_#t~post8#1, bar_#t~ret9#1, bar_#t~ret10#1, bar_#t~post11#1, bar_#t~ret12#1, bar_#t~ret13#1; [2025-02-08 14:05:35,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-6: ##fun~~TO~int_#t~ret49#1 := bar_#res#1; [2025-02-08 14:05:35,600 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:05:35,600 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:05:35,828 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:05:35,828 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:05:35,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:05:35 BoogieIcfgContainer [2025-02-08 14:05:35,829 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:05:35,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:05:35,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:05:35,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:05:35,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:05:34" (1/3) ... [2025-02-08 14:05:35,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2570e07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:05:35, skipping insertion in model container [2025-02-08 14:05:35,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (2/3) ... [2025-02-08 14:05:35,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2570e07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:05:35, skipping insertion in model container [2025-02-08 14:05:35,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:05:35" (3/3) ... [2025-02-08 14:05:35,838 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_20-callback_racefree.i [2025-02-08 14:05:35,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:05:35,850 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_20-callback_racefree.i that has 2 procedures, 61 locations, 1 initial locations, 7 loop locations, and 10 error locations. [2025-02-08 14:05:35,850 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:05:35,896 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 14:05:35,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 71 transitions, 149 flow [2025-02-08 14:05:35,972 INFO L124 PetriNetUnfolderBase]: 17/115 cut-off events. [2025-02-08 14:05:35,973 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:05:35,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 115 events. 17/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 423 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 62. Up to 6 conditions per place. [2025-02-08 14:05:35,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 71 transitions, 149 flow [2025-02-08 14:05:35,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 70 transitions, 147 flow [2025-02-08 14:05:35,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:36,003 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;@694e27d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:36,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 14:05:36,010 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:36,011 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-02-08 14:05:36,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:36,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:36,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:36,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:36,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:36,020 INFO L85 PathProgramCache]: Analyzing trace with hash 460810934, now seen corresponding path program 1 times [2025-02-08 14:05:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:36,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805559311] [2025-02-08 14:05:36,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:36,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:36,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:36,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:36,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:36,369 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-08 14:05:36,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:36,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805559311] [2025-02-08 14:05:36,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805559311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:36,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:36,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:36,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887496514] [2025-02-08 14:05:36,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:36,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:36,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:36,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:36,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:36,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 71 [2025-02-08 14:05:36,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 70 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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-08 14:05:36,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:36,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 71 [2025-02-08 14:05:36,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:36,611 INFO L124 PetriNetUnfolderBase]: 133/439 cut-off events. [2025-02-08 14:05:36,612 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:05:36,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 439 events. 133/439 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2231 event pairs, 0 based on Foata normal form. 93/482 useless extension candidates. Maximal degree in co-relation 710. Up to 269 conditions per place. [2025-02-08 14:05:36,615 INFO L140 encePairwiseOnDemand]: 57/71 looper letters, 36 selfloop transitions, 3 changer transitions 8/73 dead transitions. [2025-02-08 14:05:36,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 241 flow [2025-02-08 14:05:36,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2025-02-08 14:05:36,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6161971830985915 [2025-02-08 14:05:36,624 INFO L175 Difference]: Start difference. First operand has 64 places, 70 transitions, 147 flow. Second operand 4 states and 175 transitions. [2025-02-08 14:05:36,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 241 flow [2025-02-08 14:05:36,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 241 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:36,630 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 121 flow [2025-02-08 14:05:36,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2025-02-08 14:05:36,633 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 2 predicate places. [2025-02-08 14:05:36,633 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 121 flow [2025-02-08 14:05:36,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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-08 14:05:36,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:36,634 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:36,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:05:36,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:36,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:36,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1303456512, now seen corresponding path program 1 times [2025-02-08 14:05:36,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:36,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798972755] [2025-02-08 14:05:36,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:36,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:36,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:05:36,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:05:36,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:36,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:36,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:05:36,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:05:36,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:05:36,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:36,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:36,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:05:36,758 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:05:36,759 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-08 14:05:36,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-02-08 14:05:36,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-02-08 14:05:36,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-02-08 14:05:36,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-02-08 14:05:36,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-02-08 14:05:36,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-02-08 14:05:36,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-02-08 14:05:36,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-02-08 14:05:36,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-02-08 14:05:36,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-02-08 14:05:36,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:05:36,763 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 14:05:36,765 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:05:36,766 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:05:36,786 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:05:36,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 86 transitions, 188 flow [2025-02-08 14:05:36,805 INFO L124 PetriNetUnfolderBase]: 28/193 cut-off events. [2025-02-08 14:05:36,805 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:05:36,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 193 events. 28/193 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 885 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 123. Up to 9 conditions per place. [2025-02-08 14:05:36,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 86 transitions, 188 flow [2025-02-08 14:05:36,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 86 transitions, 188 flow [2025-02-08 14:05:36,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:36,809 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;@694e27d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:36,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 14:05:36,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:36,811 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-08 14:05:36,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:36,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:36,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:36,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:36,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:36,812 INFO L85 PathProgramCache]: Analyzing trace with hash 542893657, now seen corresponding path program 1 times [2025-02-08 14:05:36,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:36,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496789800] [2025-02-08 14:05:36,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:36,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:36,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:36,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:36,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:36,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:36,874 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-08 14:05:36,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:36,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496789800] [2025-02-08 14:05:36,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496789800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:36,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:36,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:36,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764198370] [2025-02-08 14:05:36,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:36,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:36,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:36,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:36,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 86 [2025-02-08 14:05:36,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:36,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:36,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 86 [2025-02-08 14:05:36,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:37,381 INFO L124 PetriNetUnfolderBase]: 2194/4708 cut-off events. [2025-02-08 14:05:37,381 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-02-08 14:05:37,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8316 conditions, 4708 events. 2194/4708 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 35591 event pairs, 990 based on Foata normal form. 1034/5270 useless extension candidates. Maximal degree in co-relation 1105. Up to 3544 conditions per place. [2025-02-08 14:05:37,408 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 49 selfloop transitions, 3 changer transitions 8/91 dead transitions. [2025-02-08 14:05:37,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 312 flow [2025-02-08 14:05:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2025-02-08 14:05:37,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2025-02-08 14:05:37,411 INFO L175 Difference]: Start difference. First operand has 78 places, 86 transitions, 188 flow. Second operand 4 states and 210 transitions. [2025-02-08 14:05:37,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 312 flow [2025-02-08 14:05:37,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 91 transitions, 312 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:37,414 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 176 flow [2025-02-08 14:05:37,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=83, PETRI_TRANSITIONS=70} [2025-02-08 14:05:37,415 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 5 predicate places. [2025-02-08 14:05:37,415 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 176 flow [2025-02-08 14:05:37,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:37,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:37,416 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:37,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:05:37,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:37,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash 248345742, now seen corresponding path program 1 times [2025-02-08 14:05:37,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:37,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613205304] [2025-02-08 14:05:37,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:37,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:37,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:37,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:37,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:37,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:37,525 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-08 14:05:37,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:37,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613205304] [2025-02-08 14:05:37,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613205304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:37,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:37,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:37,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285872055] [2025-02-08 14:05:37,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:37,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:05:37,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:37,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:05:37,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:05:37,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 86 [2025-02-08 14:05:37,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 70 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 35.5) internal successors, (213), 6 states have internal predecessors, (213), 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-08 14:05:37,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:37,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 86 [2025-02-08 14:05:37,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:37,962 INFO L124 PetriNetUnfolderBase]: 1654/3724 cut-off events. [2025-02-08 14:05:37,963 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2025-02-08 14:05:37,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6690 conditions, 3724 events. 1654/3724 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 28891 event pairs, 77 based on Foata normal form. 49/3415 useless extension candidates. Maximal degree in co-relation 965. Up to 2018 conditions per place. [2025-02-08 14:05:37,986 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 69 selfloop transitions, 6 changer transitions 0/106 dead transitions. [2025-02-08 14:05:37,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 106 transitions, 396 flow [2025-02-08 14:05:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:05:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:05:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 280 transitions. [2025-02-08 14:05:37,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5426356589147286 [2025-02-08 14:05:37,989 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 176 flow. Second operand 6 states and 280 transitions. [2025-02-08 14:05:37,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 106 transitions, 396 flow [2025-02-08 14:05:37,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 106 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:37,992 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 182 flow [2025-02-08 14:05:37,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2025-02-08 14:05:37,992 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 0 predicate places. [2025-02-08 14:05:37,992 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 182 flow [2025-02-08 14:05:37,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.5) internal successors, (213), 6 states have internal predecessors, (213), 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-08 14:05:37,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:37,992 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:37,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:05:37,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:37,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:37,993 INFO L85 PathProgramCache]: Analyzing trace with hash 248320164, now seen corresponding path program 1 times [2025-02-08 14:05:37,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:37,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997695158] [2025-02-08 14:05:37,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:37,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:38,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:38,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:38,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:38,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:38,140 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-08 14:05:38,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:38,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997695158] [2025-02-08 14:05:38,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997695158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:38,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:38,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:38,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796753264] [2025-02-08 14:05:38,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:38,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:05:38,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:38,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:05:38,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:05:38,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 86 [2025-02-08 14:05:38,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:38,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:38,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 86 [2025-02-08 14:05:38,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:38,459 INFO L124 PetriNetUnfolderBase]: 1574/3471 cut-off events. [2025-02-08 14:05:38,459 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2025-02-08 14:05:38,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6428 conditions, 3471 events. 1574/3471 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 26175 event pairs, 85 based on Foata normal form. 7/3211 useless extension candidates. Maximal degree in co-relation 905. Up to 2127 conditions per place. [2025-02-08 14:05:38,474 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 60 selfloop transitions, 4 changer transitions 0/95 dead transitions. [2025-02-08 14:05:38,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 95 transitions, 362 flow [2025-02-08 14:05:38,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:05:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:05:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2025-02-08 14:05:38,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5465116279069767 [2025-02-08 14:05:38,476 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 182 flow. Second operand 5 states and 235 transitions. [2025-02-08 14:05:38,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 95 transitions, 362 flow [2025-02-08 14:05:38,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 95 transitions, 350 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 14:05:38,478 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 182 flow [2025-02-08 14:05:38,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2025-02-08 14:05:38,479 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-02-08 14:05:38,479 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 182 flow [2025-02-08 14:05:38,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:38,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:38,479 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:05:38,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:05:38,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:38,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash -891216104, now seen corresponding path program 1 times [2025-02-08 14:05:38,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:38,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798195805] [2025-02-08 14:05:38,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:38,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:38,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:38,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:38,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:38,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:38,523 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-08 14:05:38,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:38,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798195805] [2025-02-08 14:05:38,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798195805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:38,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:38,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:38,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175861585] [2025-02-08 14:05:38,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:38,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:38,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:38,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:38,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:38,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 86 [2025-02-08 14:05:38,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:38,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:38,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 86 [2025-02-08 14:05:38,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:38,761 INFO L124 PetriNetUnfolderBase]: 1490/3289 cut-off events. [2025-02-08 14:05:38,761 INFO L125 PetriNetUnfolderBase]: For 510/510 co-relation queries the response was YES. [2025-02-08 14:05:38,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6064 conditions, 3289 events. 1490/3289 cut-off events. For 510/510 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 24304 event pairs, 85 based on Foata normal form. 49/3075 useless extension candidates. Maximal degree in co-relation 3984. Up to 2007 conditions per place. [2025-02-08 14:05:38,776 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 56 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2025-02-08 14:05:38,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 93 transitions, 352 flow [2025-02-08 14:05:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2025-02-08 14:05:38,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5726744186046512 [2025-02-08 14:05:38,777 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 182 flow. Second operand 4 states and 197 transitions. [2025-02-08 14:05:38,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 93 transitions, 352 flow [2025-02-08 14:05:38,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 340 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-02-08 14:05:38,780 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 186 flow [2025-02-08 14:05:38,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2025-02-08 14:05:38,781 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2025-02-08 14:05:38,781 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 186 flow [2025-02-08 14:05:38,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:38,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:38,781 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:05:38,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:05:38,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:38,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:38,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1760165941, now seen corresponding path program 1 times [2025-02-08 14:05:38,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:38,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674622385] [2025-02-08 14:05:38,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:38,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:38,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:05:38,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:05:38,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:38,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:38,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:05:38,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:05:38,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:05:38,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:38,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:38,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:05:38,817 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:05:38,817 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-08 14:05:38,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-02-08 14:05:38,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-02-08 14:05:38,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-02-08 14:05:38,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-02-08 14:05:38,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-02-08 14:05:38,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-02-08 14:05:38,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-02-08 14:05:38,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-02-08 14:05:38,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-02-08 14:05:38,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-02-08 14:05:38,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:05:38,818 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 14:05:38,818 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:05:38,819 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 14:05:38,834 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:05:38,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 101 transitions, 229 flow [2025-02-08 14:05:38,846 INFO L124 PetriNetUnfolderBase]: 42/290 cut-off events. [2025-02-08 14:05:38,847 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 14:05:38,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 290 events. 42/290 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1417 event pairs, 1 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 208. Up to 12 conditions per place. [2025-02-08 14:05:38,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 101 transitions, 229 flow [2025-02-08 14:05:38,849 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 101 transitions, 229 flow [2025-02-08 14:05:38,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:38,850 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;@694e27d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:38,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 14:05:38,851 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:38,851 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-02-08 14:05:38,851 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:38,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:38,851 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:38,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:38,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:38,852 INFO L85 PathProgramCache]: Analyzing trace with hash 639290955, now seen corresponding path program 1 times [2025-02-08 14:05:38,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:38,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908442717] [2025-02-08 14:05:38,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:38,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:38,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:38,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:38,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:38,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:38,892 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-08 14:05:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908442717] [2025-02-08 14:05:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908442717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:38,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:38,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:38,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421166594] [2025-02-08 14:05:38,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:38,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:38,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:38,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:38,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:38,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 101 [2025-02-08 14:05:38,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 101 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-08 14:05:38,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:38,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 101 [2025-02-08 14:05:38,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:41,401 INFO L124 PetriNetUnfolderBase]: 24262/41768 cut-off events. [2025-02-08 14:05:41,402 INFO L125 PetriNetUnfolderBase]: For 751/751 co-relation queries the response was YES. [2025-02-08 14:05:41,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76518 conditions, 41768 events. 24262/41768 cut-off events. For 751/751 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 363577 event pairs, 15385 based on Foata normal form. 10135/48425 useless extension candidates. Maximal degree in co-relation 8294. Up to 34313 conditions per place. [2025-02-08 14:05:41,606 INFO L140 encePairwiseOnDemand]: 83/101 looper letters, 57 selfloop transitions, 3 changer transitions 8/104 dead transitions. [2025-02-08 14:05:41,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 104 transitions, 365 flow [2025-02-08 14:05:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2025-02-08 14:05:41,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.594059405940594 [2025-02-08 14:05:41,608 INFO L175 Difference]: Start difference. First operand has 92 places, 101 transitions, 229 flow. Second operand 4 states and 240 transitions. [2025-02-08 14:05:41,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 104 transitions, 365 flow [2025-02-08 14:05:41,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 104 transitions, 365 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:41,611 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 213 flow [2025-02-08 14:05:41,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2025-02-08 14:05:41,611 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 5 predicate places. [2025-02-08 14:05:41,612 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 213 flow [2025-02-08 14:05:41,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-08 14:05:41,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:41,612 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:41,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:05:41,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:41,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1040540722, now seen corresponding path program 1 times [2025-02-08 14:05:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:41,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603376891] [2025-02-08 14:05:41,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:41,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:41,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:41,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:41,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:41,686 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-08 14:05:41,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:41,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603376891] [2025-02-08 14:05:41,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603376891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:41,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:41,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:41,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909880138] [2025-02-08 14:05:41,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:41,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:05:41,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:41,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:05:41,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:05:41,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 101 [2025-02-08 14:05:41,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 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-08 14:05:41,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:41,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 101 [2025-02-08 14:05:41,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:43,520 INFO L124 PetriNetUnfolderBase]: 18256/33619 cut-off events. [2025-02-08 14:05:43,521 INFO L125 PetriNetUnfolderBase]: For 2052/2052 co-relation queries the response was YES. [2025-02-08 14:05:43,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61470 conditions, 33619 events. 18256/33619 cut-off events. For 2052/2052 co-relation queries the response was YES. Maximal size of possible extension queue 1102. Compared 313791 event pairs, 1456 based on Foata normal form. 392/31259 useless extension candidates. Maximal degree in co-relation 8879. Up to 19327 conditions per place. [2025-02-08 14:05:43,671 INFO L140 encePairwiseOnDemand]: 96/101 looper letters, 89 selfloop transitions, 6 changer transitions 0/131 dead transitions. [2025-02-08 14:05:43,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 131 transitions, 497 flow [2025-02-08 14:05:43,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:05:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:05:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 330 transitions. [2025-02-08 14:05:43,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5445544554455446 [2025-02-08 14:05:43,673 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 213 flow. Second operand 6 states and 330 transitions. [2025-02-08 14:05:43,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 131 transitions, 497 flow [2025-02-08 14:05:43,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 131 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:43,677 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 219 flow [2025-02-08 14:05:43,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=207, 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=219, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2025-02-08 14:05:43,678 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 0 predicate places. [2025-02-08 14:05:43,678 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 219 flow [2025-02-08 14:05:43,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 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-08 14:05:43,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:43,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:43,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:05:43,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:43,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:43,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1040578793, now seen corresponding path program 1 times [2025-02-08 14:05:43,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:43,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082075482] [2025-02-08 14:05:43,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:43,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:43,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:43,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:43,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:43,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:43,755 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-08 14:05:43,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:43,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082075482] [2025-02-08 14:05:43,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082075482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:43,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:43,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:43,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386743638] [2025-02-08 14:05:43,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:43,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:05:43,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:43,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:05:43,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:05:43,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 101 [2025-02-08 14:05:43,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 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-08 14:05:43,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:43,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 101 [2025-02-08 14:05:43,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:45,673 INFO L124 PetriNetUnfolderBase]: 18176/32568 cut-off events. [2025-02-08 14:05:45,674 INFO L125 PetriNetUnfolderBase]: For 4179/4179 co-relation queries the response was YES. [2025-02-08 14:05:45,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61439 conditions, 32568 events. 18176/32568 cut-off events. For 4179/4179 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 291311 event pairs, 5360 based on Foata normal form. 7/30418 useless extension candidates. Maximal degree in co-relation 6796. Up to 25267 conditions per place. [2025-02-08 14:05:45,831 INFO L140 encePairwiseOnDemand]: 97/101 looper letters, 71 selfloop transitions, 4 changer transitions 0/111 dead transitions. [2025-02-08 14:05:45,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 111 transitions, 437 flow [2025-02-08 14:05:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:05:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:05:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 271 transitions. [2025-02-08 14:05:45,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5366336633663367 [2025-02-08 14:05:45,832 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 219 flow. Second operand 5 states and 271 transitions. [2025-02-08 14:05:45,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 111 transitions, 437 flow [2025-02-08 14:05:45,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 111 transitions, 423 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-08 14:05:45,836 INFO L231 Difference]: Finished difference. Result has 93 places, 83 transitions, 227 flow [2025-02-08 14:05:45,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=207, 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=227, PETRI_PLACES=93, PETRI_TRANSITIONS=83} [2025-02-08 14:05:45,837 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 1 predicate places. [2025-02-08 14:05:45,837 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 83 transitions, 227 flow [2025-02-08 14:05:45,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 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-08 14:05:45,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:45,837 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:05:45,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:05:45,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:45,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:45,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2102976573, now seen corresponding path program 1 times [2025-02-08 14:05:45,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:45,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50998176] [2025-02-08 14:05:45,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:45,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:45,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:45,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:45,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:45,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:45,892 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-08 14:05:45,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:45,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50998176] [2025-02-08 14:05:45,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50998176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:45,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:45,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:45,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7977377] [2025-02-08 14:05:45,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:45,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:45,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:45,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:45,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:45,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 101 [2025-02-08 14:05:45,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 83 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:45,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:45,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 101 [2025-02-08 14:05:45,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:47,369 INFO L124 PetriNetUnfolderBase]: 17210/31712 cut-off events. [2025-02-08 14:05:47,369 INFO L125 PetriNetUnfolderBase]: For 3823/3823 co-relation queries the response was YES. [2025-02-08 14:05:47,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58490 conditions, 31712 events. 17210/31712 cut-off events. For 3823/3823 co-relation queries the response was YES. Maximal size of possible extension queue 1039. Compared 293723 event pairs, 1610 based on Foata normal form. 392/29916 useless extension candidates. Maximal degree in co-relation 21315. Up to 20541 conditions per place. [2025-02-08 14:05:47,498 INFO L140 encePairwiseOnDemand]: 96/101 looper letters, 76 selfloop transitions, 7 changer transitions 0/119 dead transitions. [2025-02-08 14:05:47,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 119 transitions, 463 flow [2025-02-08 14:05:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2025-02-08 14:05:47,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5866336633663366 [2025-02-08 14:05:47,500 INFO L175 Difference]: Start difference. First operand has 93 places, 83 transitions, 227 flow. Second operand 4 states and 237 transitions. [2025-02-08 14:05:47,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 119 transitions, 463 flow [2025-02-08 14:05:47,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 119 transitions, 451 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 14:05:47,506 INFO L231 Difference]: Finished difference. Result has 92 places, 83 transitions, 234 flow [2025-02-08 14:05:47,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=92, PETRI_TRANSITIONS=83} [2025-02-08 14:05:47,507 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 0 predicate places. [2025-02-08 14:05:47,507 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 83 transitions, 234 flow [2025-02-08 14:05:47,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:47,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:47,508 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:47,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:05:47,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:47,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1786590068, now seen corresponding path program 1 times [2025-02-08 14:05:47,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:47,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056567501] [2025-02-08 14:05:47,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:47,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:05:47,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:05:47,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:47,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:47,557 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-08 14:05:47,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056567501] [2025-02-08 14:05:47,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056567501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:47,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:47,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093457125] [2025-02-08 14:05:47,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:47,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:47,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:47,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:47,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 101 [2025-02-08 14:05:47,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 83 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:47,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:47,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 101 [2025-02-08 14:05:47,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:50,323 INFO L124 PetriNetUnfolderBase]: 28796/52530 cut-off events. [2025-02-08 14:05:50,324 INFO L125 PetriNetUnfolderBase]: For 6154/6154 co-relation queries the response was YES. [2025-02-08 14:05:50,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95979 conditions, 52530 events. 28796/52530 cut-off events. For 6154/6154 co-relation queries the response was YES. Maximal size of possible extension queue 1683. Compared 510748 event pairs, 17714 based on Foata normal form. 392/49133 useless extension candidates. Maximal degree in co-relation 16372. Up to 25659 conditions per place. [2025-02-08 14:05:50,593 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 91 selfloop transitions, 3 changer transitions 0/130 dead transitions. [2025-02-08 14:05:50,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 130 transitions, 516 flow [2025-02-08 14:05:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:50,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2025-02-08 14:05:50,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6287128712871287 [2025-02-08 14:05:50,595 INFO L175 Difference]: Start difference. First operand has 92 places, 83 transitions, 234 flow. Second operand 4 states and 254 transitions. [2025-02-08 14:05:50,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 130 transitions, 516 flow [2025-02-08 14:05:50,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 130 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:05:50,599 INFO L231 Difference]: Finished difference. Result has 95 places, 85 transitions, 249 flow [2025-02-08 14:05:50,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=95, PETRI_TRANSITIONS=85} [2025-02-08 14:05:50,599 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 3 predicate places. [2025-02-08 14:05:50,599 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 85 transitions, 249 flow [2025-02-08 14:05:50,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:50,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:50,600 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-02-08 14:05:50,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 14:05:50,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:50,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2061595777, now seen corresponding path program 1 times [2025-02-08 14:05:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:50,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55666339] [2025-02-08 14:05:50,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:50,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:50,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:05:50,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:05:50,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:50,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:50,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:05:50,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:05:50,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:05:50,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:50,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:50,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:05:50,651 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:05:50,651 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-08 14:05:50,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-02-08 14:05:50,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-02-08 14:05:50,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-02-08 14:05:50,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-02-08 14:05:50,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-02-08 14:05:50,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-02-08 14:05:50,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-02-08 14:05:50,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-02-08 14:05:50,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-02-08 14:05:50,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-02-08 14:05:50,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 14:05:50,652 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 14:05:50,652 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:05:50,652 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 14:05:50,670 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 14:05:50,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 116 transitions, 272 flow [2025-02-08 14:05:50,686 INFO L124 PetriNetUnfolderBase]: 64/427 cut-off events. [2025-02-08 14:05:50,686 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 14:05:50,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 427 events. 64/427 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2187 event pairs, 6 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 318. Up to 32 conditions per place. [2025-02-08 14:05:50,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 116 transitions, 272 flow [2025-02-08 14:05:50,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 116 transitions, 272 flow [2025-02-08 14:05:50,690 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:50,690 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;@694e27d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:50,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 14:05:50,691 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:50,691 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-08 14:05:50,692 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:50,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:50,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:50,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 14:05:50,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash 750002828, now seen corresponding path program 1 times [2025-02-08 14:05:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:50,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196901589] [2025-02-08 14:05:50,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:50,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:50,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:50,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:50,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:50,732 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-08 14:05:50,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196901589] [2025-02-08 14:05:50,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196901589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:50,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:50,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:50,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193586584] [2025-02-08 14:05:50,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:50,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:50,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:50,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:50,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:50,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 116 [2025-02-08 14:05:50,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 116 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-08 14:05:50,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:50,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 116 [2025-02-08 14:05:50,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand