./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:45:05,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:45:05,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:45:05,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:45:05,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:45:05,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:45:05,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:45:05,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:45:05,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:45:05,108 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:45:05,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:45:05,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:45:05,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:45:05,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:45:05,109 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:45:05,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:45:05,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:45:05,109 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:45:05,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:45:05,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:45:05,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:45:05,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:45:05,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:45:05,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:45:05,110 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:45:05,110 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:45:05,110 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:45:05,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:45:05,111 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:45:05,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:45:05,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:45:05,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:45:05,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:45:05,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:45:05,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:45:05,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:45:05,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:45:05,112 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:45:05,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:45:05,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:45:05,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:45:05,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:45:05,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:45:05,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:45:05,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:45:05,112 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 -> a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 [2025-02-06 18:45:05,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:45:05,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:45:05,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:45:05,419 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:45:05,419 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:45:05,420 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_19-callback_racing.i [2025-02-06 18:45:06,738 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b22fc4b61/b7747b5a524947d5ba3ab332a60a7026/FLAGb6aa92fc2 [2025-02-06 18:45:07,061 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:45:07,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2025-02-06 18:45:07,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b22fc4b61/b7747b5a524947d5ba3ab332a60a7026/FLAGb6aa92fc2 [2025-02-06 18:45:07,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b22fc4b61/b7747b5a524947d5ba3ab332a60a7026 [2025-02-06 18:45:07,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:45:07,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:45:07,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:45:07,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:45:07,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:45:07,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16212876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07, skipping insertion in model container [2025-02-06 18:45:07,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:45:07,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:45:07,376 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:45:07,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:45:07,461 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:45:07,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07 WrapperNode [2025-02-06 18:45:07,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:45:07,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:45:07,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:45:07,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:45:07,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,511 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 146 [2025-02-06 18:45:07,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:45:07,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:45:07,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:45:07,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:45:07,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,542 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 2, 5, 5, 5]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 0, 5, 5, 5]. The 1 writes are split as follows [0, 1, 0, 0, 0]. [2025-02-06 18:45:07,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:45:07,568 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:45:07,568 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:45:07,568 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:45:07,569 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07" (1/1) ... [2025-02-06 18:45:07,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:45:07,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:45:07,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:45:07,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:45:07,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:45:07,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:45:07,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:45:07,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 18:45:07,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 18:45:07,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:45:07,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:45:07,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:45:07,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 18:45:07,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 18:45:07,624 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 18:45:07,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:45:07,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:45:07,625 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 18:45:07,625 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 18:45:07,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:45:07,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:45:07,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:45:07,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:45:07,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 18:45:07,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 18:45:07,625 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 18:45:07,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:45:07,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:45:07,627 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:45:07,765 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:45:07,767 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:45:08,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 18:45:08,036 INFO L1309 $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-06 18:45:08,073 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:45:08,075 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:45:08,285 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:45:08,286 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:45:08,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:45:08 BoogieIcfgContainer [2025-02-06 18:45:08,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:45:08,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:45:08,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:45:08,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:45:08,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:45:07" (1/3) ... [2025-02-06 18:45:08,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ed72e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:45:08, skipping insertion in model container [2025-02-06 18:45:08,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:07" (2/3) ... [2025-02-06 18:45:08,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ed72e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:45:08, skipping insertion in model container [2025-02-06 18:45:08,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:45:08" (3/3) ... [2025-02-06 18:45:08,294 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_19-callback_racing.i [2025-02-06 18:45:08,304 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:45:08,305 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_19-callback_racing.i that has 2 procedures, 61 locations, 1 initial locations, 7 loop locations, and 10 error locations. [2025-02-06 18:45:08,306 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:45:08,348 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 18:45:08,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 72 transitions, 151 flow [2025-02-06 18:45:08,447 INFO L124 PetriNetUnfolderBase]: 19/117 cut-off events. [2025-02-06 18:45:08,448 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:45:08,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 117 events. 19/117 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 429 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 63. Up to 6 conditions per place. [2025-02-06 18:45:08,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 72 transitions, 151 flow [2025-02-06 18:45:08,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 71 transitions, 149 flow [2025-02-06 18:45:08,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:08,477 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;@4b12e590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:08,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 18:45:08,486 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:08,487 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-02-06 18:45:08,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:08,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:08,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:08,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:08,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash 373969180, now seen corresponding path program 1 times [2025-02-06 18:45:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:08,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729538856] [2025-02-06 18:45:08,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:08,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:08,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:08,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:08,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:08,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:08,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:08,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729538856] [2025-02-06 18:45:08,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729538856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:08,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:08,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647424816] [2025-02-06 18:45:08,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:08,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:08,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:08,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:08,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 72 [2025-02-06 18:45:08,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 71 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:08,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:08,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 72 [2025-02-06 18:45:08,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:09,099 INFO L124 PetriNetUnfolderBase]: 134/440 cut-off events. [2025-02-06 18:45:09,100 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:45:09,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 440 events. 134/440 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2251 event pairs, 0 based on Foata normal form. 91/481 useless extension candidates. Maximal degree in co-relation 705. Up to 263 conditions per place. [2025-02-06 18:45:09,106 INFO L140 encePairwiseOnDemand]: 58/72 looper letters, 40 selfloop transitions, 3 changer transitions 1/74 dead transitions. [2025-02-06 18:45:09,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 243 flow [2025-02-06 18:45:09,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2025-02-06 18:45:09,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6215277777777778 [2025-02-06 18:45:09,122 INFO L175 Difference]: Start difference. First operand has 64 places, 71 transitions, 149 flow. Second operand 4 states and 179 transitions. [2025-02-06 18:45:09,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 243 flow [2025-02-06 18:45:09,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:09,132 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 137 flow [2025-02-06 18:45:09,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-02-06 18:45:09,138 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 2 predicate places. [2025-02-06 18:45:09,139 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 137 flow [2025-02-06 18:45:09,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:09,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:09,139 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:09,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:45:09,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:09,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:09,141 INFO L85 PathProgramCache]: Analyzing trace with hash -229015073, now seen corresponding path program 1 times [2025-02-06 18:45:09,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:09,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973344102] [2025-02-06 18:45:09,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:09,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:09,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:45:09,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:45:09,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:09,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:09,177 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:45:09,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:45:09,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:45:09,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:09,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:09,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:45:09,224 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:45:09,225 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-06 18:45:09,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-02-06 18:45:09,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-02-06 18:45:09,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-02-06 18:45:09,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-02-06 18:45:09,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-02-06 18:45:09,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-02-06 18:45:09,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-02-06 18:45:09,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-02-06 18:45:09,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-02-06 18:45:09,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-02-06 18:45:09,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:45:09,230 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 18:45:09,233 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:45:09,233 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 18:45:09,258 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 18:45:09,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 87 transitions, 190 flow [2025-02-06 18:45:09,300 INFO L124 PetriNetUnfolderBase]: 31/196 cut-off events. [2025-02-06 18:45:09,302 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 18:45:09,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 196 events. 31/196 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 873 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 125. Up to 9 conditions per place. [2025-02-06 18:45:09,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 87 transitions, 190 flow [2025-02-06 18:45:09,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 87 transitions, 190 flow [2025-02-06 18:45:09,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:09,310 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;@4b12e590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:09,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 18:45:09,313 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:09,314 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-06 18:45:09,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:09,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:09,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:09,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:09,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash 457006208, now seen corresponding path program 1 times [2025-02-06 18:45:09,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:09,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91723528] [2025-02-06 18:45:09,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:09,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:09,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:09,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:09,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:09,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:09,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:09,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91723528] [2025-02-06 18:45:09,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91723528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:09,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:09,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:09,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718911702] [2025-02-06 18:45:09,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:09,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:09,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:09,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:09,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:09,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 87 [2025-02-06 18:45:09,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 87 transitions, 190 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-06 18:45:09,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:09,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 87 [2025-02-06 18:45:09,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:10,199 INFO L124 PetriNetUnfolderBase]: 2160/4646 cut-off events. [2025-02-06 18:45:10,200 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-02-06 18:45:10,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8164 conditions, 4646 events. 2160/4646 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 35001 event pairs, 948 based on Foata normal form. 1004/5171 useless extension candidates. Maximal degree in co-relation 1082. Up to 3454 conditions per place. [2025-02-06 18:45:10,242 INFO L140 encePairwiseOnDemand]: 71/87 looper letters, 53 selfloop transitions, 3 changer transitions 1/92 dead transitions. [2025-02-06 18:45:10,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 92 transitions, 314 flow [2025-02-06 18:45:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-02-06 18:45:10,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6149425287356322 [2025-02-06 18:45:10,249 INFO L175 Difference]: Start difference. First operand has 78 places, 87 transitions, 190 flow. Second operand 4 states and 214 transitions. [2025-02-06 18:45:10,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 92 transitions, 314 flow [2025-02-06 18:45:10,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 92 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:10,252 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 192 flow [2025-02-06 18:45:10,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2025-02-06 18:45:10,254 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 5 predicate places. [2025-02-06 18:45:10,254 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 192 flow [2025-02-06 18:45:10,255 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-06 18:45:10,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:10,255 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:10,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:45:10,255 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:10,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1372861678, now seen corresponding path program 1 times [2025-02-06 18:45:10,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:10,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593447876] [2025-02-06 18:45:10,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:10,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:45:10,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:45:10,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:10,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:10,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:10,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593447876] [2025-02-06 18:45:10,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593447876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:10,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:10,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:45:10,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311206629] [2025-02-06 18:45:10,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:10,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:45:10,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:10,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:45:10,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:45:10,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 87 [2025-02-06 18:45:10,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:10,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:10,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 87 [2025-02-06 18:45:10,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:11,175 INFO L124 PetriNetUnfolderBase]: 1980/4463 cut-off events. [2025-02-06 18:45:11,176 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-02-06 18:45:11,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7923 conditions, 4463 events. 1980/4463 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 34927 event pairs, 77 based on Foata normal form. 49/4154 useless extension candidates. Maximal degree in co-relation 1148. Up to 2512 conditions per place. [2025-02-06 18:45:11,198 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 73 selfloop transitions, 6 changer transitions 0/114 dead transitions. [2025-02-06 18:45:11,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 114 transitions, 420 flow [2025-02-06 18:45:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:45:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:45:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 290 transitions. [2025-02-06 18:45:11,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-02-06 18:45:11,201 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 192 flow. Second operand 6 states and 290 transitions. [2025-02-06 18:45:11,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 114 transitions, 420 flow [2025-02-06 18:45:11,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 114 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:45:11,206 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 198 flow [2025-02-06 18:45:11,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2025-02-06 18:45:11,207 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 7 predicate places. [2025-02-06 18:45:11,207 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 198 flow [2025-02-06 18:45:11,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:11,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:11,208 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:45:11,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:45:11,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:11,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash -390960546, now seen corresponding path program 1 times [2025-02-06 18:45:11,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:11,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871564307] [2025-02-06 18:45:11,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:11,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:11,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:11,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:11,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:11,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:11,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:11,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871564307] [2025-02-06 18:45:11,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871564307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:11,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:11,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:45:11,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635838445] [2025-02-06 18:45:11,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:11,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:11,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:11,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:11,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:11,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 87 [2025-02-06 18:45:11,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:11,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:11,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 87 [2025-02-06 18:45:11,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:11,687 INFO L124 PetriNetUnfolderBase]: 1896/4297 cut-off events. [2025-02-06 18:45:11,688 INFO L125 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2025-02-06 18:45:11,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7737 conditions, 4297 events. 1896/4297 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 33457 event pairs, 132 based on Foata normal form. 49/4044 useless extension candidates. Maximal degree in co-relation 4848. Up to 2658 conditions per place. [2025-02-06 18:45:11,709 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 60 selfloop transitions, 6 changer transitions 0/101 dead transitions. [2025-02-06 18:45:11,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 101 transitions, 376 flow [2025-02-06 18:45:11,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:11,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-02-06 18:45:11,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5890804597701149 [2025-02-06 18:45:11,711 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 198 flow. Second operand 4 states and 205 transitions. [2025-02-06 18:45:11,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 101 transitions, 376 flow [2025-02-06 18:45:11,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 101 transitions, 360 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-06 18:45:11,717 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 198 flow [2025-02-06 18:45:11,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2025-02-06 18:45:11,719 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 5 predicate places. [2025-02-06 18:45:11,719 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 198 flow [2025-02-06 18:45:11,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:11,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:11,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:11,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:45:11,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:11,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:11,721 INFO L85 PathProgramCache]: Analyzing trace with hash -391752446, now seen corresponding path program 1 times [2025-02-06 18:45:11,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:11,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105252048] [2025-02-06 18:45:11,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:11,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:11,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:11,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:11,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:11,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:11,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:11,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105252048] [2025-02-06 18:45:11,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105252048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:11,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:11,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:45:11,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536014579] [2025-02-06 18:45:11,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:11,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:45:11,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:11,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:45:11,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:45:11,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 87 [2025-02-06 18:45:11,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:11,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:11,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 87 [2025-02-06 18:45:11,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:12,200 INFO L124 PetriNetUnfolderBase]: 1791/3954 cut-off events. [2025-02-06 18:45:12,200 INFO L125 PetriNetUnfolderBase]: For 586/586 co-relation queries the response was YES. [2025-02-06 18:45:12,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7184 conditions, 3954 events. 1791/3954 cut-off events. For 586/586 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 29579 event pairs, 118 based on Foata normal form. 7/3692 useless extension candidates. Maximal degree in co-relation 4812. Up to 2575 conditions per place. [2025-02-06 18:45:12,227 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 63 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2025-02-06 18:45:12,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 102 transitions, 385 flow [2025-02-06 18:45:12,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:45:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:45:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2025-02-06 18:45:12,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5586206896551724 [2025-02-06 18:45:12,229 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 198 flow. Second operand 5 states and 243 transitions. [2025-02-06 18:45:12,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 102 transitions, 385 flow [2025-02-06 18:45:12,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 102 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:45:12,235 INFO L231 Difference]: Finished difference. Result has 86 places, 77 transitions, 202 flow [2025-02-06 18:45:12,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=86, PETRI_TRANSITIONS=77} [2025-02-06 18:45:12,236 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 8 predicate places. [2025-02-06 18:45:12,236 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 202 flow [2025-02-06 18:45:12,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:12,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:12,236 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-06 18:45:12,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:45:12,237 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:12,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2050914735, now seen corresponding path program 1 times [2025-02-06 18:45:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:12,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482801508] [2025-02-06 18:45:12,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:12,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:12,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:45:12,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:45:12,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:12,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:12,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:45:12,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:45:12,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:45:12,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:12,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:12,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:45:12,290 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:45:12,290 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-06 18:45:12,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-02-06 18:45:12,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-02-06 18:45:12,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-02-06 18:45:12,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-02-06 18:45:12,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-02-06 18:45:12,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-02-06 18:45:12,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-02-06 18:45:12,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-02-06 18:45:12,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-02-06 18:45:12,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-02-06 18:45:12,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:45:12,292 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 18:45:12,292 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:45:12,293 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 18:45:12,314 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 18:45:12,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 102 transitions, 231 flow [2025-02-06 18:45:12,354 INFO L124 PetriNetUnfolderBase]: 46/294 cut-off events. [2025-02-06 18:45:12,354 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 18:45:12,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 294 events. 46/294 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1415 event pairs, 1 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 211. Up to 12 conditions per place. [2025-02-06 18:45:12,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 102 transitions, 231 flow [2025-02-06 18:45:12,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 102 transitions, 231 flow [2025-02-06 18:45:12,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:12,364 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;@4b12e590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:12,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 18:45:12,366 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:12,366 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-02-06 18:45:12,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:12,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:12,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:12,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:12,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash 554357811, now seen corresponding path program 1 times [2025-02-06 18:45:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:12,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257917137] [2025-02-06 18:45:12,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:12,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:12,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:12,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:12,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:12,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:12,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257917137] [2025-02-06 18:45:12,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257917137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:12,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:12,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:12,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278396936] [2025-02-06 18:45:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:12,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:12,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:12,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:12,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:12,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 102 [2025-02-06 18:45:12,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 102 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:12,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:12,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 102 [2025-02-06 18:45:12,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:15,332 INFO L124 PetriNetUnfolderBase]: 23689/40886 cut-off events. [2025-02-06 18:45:15,332 INFO L125 PetriNetUnfolderBase]: For 751/751 co-relation queries the response was YES. [2025-02-06 18:45:15,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74664 conditions, 40886 events. 23689/40886 cut-off events. For 751/751 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 355545 event pairs, 14755 based on Foata normal form. 9811/47170 useless extension candidates. Maximal degree in co-relation 8136. Up to 33341 conditions per place. [2025-02-06 18:45:15,584 INFO L140 encePairwiseOnDemand]: 84/102 looper letters, 61 selfloop transitions, 3 changer transitions 1/105 dead transitions. [2025-02-06 18:45:15,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 105 transitions, 367 flow [2025-02-06 18:45:15,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2025-02-06 18:45:15,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5980392156862745 [2025-02-06 18:45:15,586 INFO L175 Difference]: Start difference. First operand has 92 places, 102 transitions, 231 flow. Second operand 4 states and 244 transitions. [2025-02-06 18:45:15,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 105 transitions, 367 flow [2025-02-06 18:45:15,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 105 transitions, 367 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:15,589 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 229 flow [2025-02-06 18:45:15,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2025-02-06 18:45:15,590 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 5 predicate places. [2025-02-06 18:45:15,590 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 229 flow [2025-02-06 18:45:15,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:15,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:15,591 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:15,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:45:15,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:15,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:15,591 INFO L85 PathProgramCache]: Analyzing trace with hash 739904718, now seen corresponding path program 1 times [2025-02-06 18:45:15,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:15,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136337952] [2025-02-06 18:45:15,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:15,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:45:15,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:45:15,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:15,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:15,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:15,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136337952] [2025-02-06 18:45:15,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136337952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:15,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:15,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:45:15,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175922179] [2025-02-06 18:45:15,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:15,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:45:15,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:15,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:45:15,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:45:15,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 102 [2025-02-06 18:45:15,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 41.5) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:15,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:15,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 102 [2025-02-06 18:45:15,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:18,174 INFO L124 PetriNetUnfolderBase]: 21571/39727 cut-off events. [2025-02-06 18:45:18,175 INFO L125 PetriNetUnfolderBase]: For 2052/2052 co-relation queries the response was YES. [2025-02-06 18:45:18,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72090 conditions, 39727 events. 21571/39727 cut-off events. For 2052/2052 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 372596 event pairs, 1456 based on Foata normal form. 392/37367 useless extension candidates. Maximal degree in co-relation 10445. Up to 23839 conditions per place. [2025-02-06 18:45:18,382 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 93 selfloop transitions, 6 changer transitions 0/139 dead transitions. [2025-02-06 18:45:18,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 139 transitions, 521 flow [2025-02-06 18:45:18,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:45:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:45:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 340 transitions. [2025-02-06 18:45:18,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-02-06 18:45:18,385 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 229 flow. Second operand 6 states and 340 transitions. [2025-02-06 18:45:18,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 139 transitions, 521 flow [2025-02-06 18:45:18,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 139 transitions, 519 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:45:18,391 INFO L231 Difference]: Finished difference. Result has 99 places, 90 transitions, 235 flow [2025-02-06 18:45:18,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2025-02-06 18:45:18,393 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 7 predicate places. [2025-02-06 18:45:18,393 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 235 flow [2025-02-06 18:45:18,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.5) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:18,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:18,393 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:45:18,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:45:18,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:18,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1462210276, now seen corresponding path program 1 times [2025-02-06 18:45:18,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:18,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355270292] [2025-02-06 18:45:18,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:18,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:18,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:18,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:18,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:18,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:18,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:18,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355270292] [2025-02-06 18:45:18,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355270292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:18,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:18,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:45:18,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439354172] [2025-02-06 18:45:18,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:18,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:18,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:18,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:18,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:18,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 102 [2025-02-06 18:45:18,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:18,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:18,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 102 [2025-02-06 18:45:18,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:20,757 INFO L124 PetriNetUnfolderBase]: 20605/38082 cut-off events. [2025-02-06 18:45:20,758 INFO L125 PetriNetUnfolderBase]: For 3398/3398 co-relation queries the response was YES. [2025-02-06 18:45:20,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69886 conditions, 38082 events. 20605/38082 cut-off events. For 3398/3398 co-relation queries the response was YES. Maximal size of possible extension queue 1134. Compared 358082 event pairs, 1609 based on Foata normal form. 392/36255 useless extension candidates. Maximal degree in co-relation 12002. Up to 25210 conditions per place. [2025-02-06 18:45:20,939 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 80 selfloop transitions, 6 changer transitions 0/126 dead transitions. [2025-02-06 18:45:20,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 126 transitions, 477 flow [2025-02-06 18:45:20,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 245 transitions. [2025-02-06 18:45:20,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6004901960784313 [2025-02-06 18:45:20,941 INFO L175 Difference]: Start difference. First operand has 99 places, 90 transitions, 235 flow. Second operand 4 states and 245 transitions. [2025-02-06 18:45:20,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 126 transitions, 477 flow [2025-02-06 18:45:20,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 126 transitions, 461 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-06 18:45:20,955 INFO L231 Difference]: Finished difference. Result has 97 places, 90 transitions, 235 flow [2025-02-06 18:45:20,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=97, PETRI_TRANSITIONS=90} [2025-02-06 18:45:20,956 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 5 predicate places. [2025-02-06 18:45:20,956 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 90 transitions, 235 flow [2025-02-06 18:45:20,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:20,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:20,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:20,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:45:20,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:20,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1461031093, now seen corresponding path program 1 times [2025-02-06 18:45:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:20,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066140822] [2025-02-06 18:45:20,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:20,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:20,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:20,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:20,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:20,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:21,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:21,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066140822] [2025-02-06 18:45:21,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066140822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:21,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:21,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:45:21,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839885142] [2025-02-06 18:45:21,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:21,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:45:21,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:21,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:45:21,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:45:21,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 102 [2025-02-06 18:45:21,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 90 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:21,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:21,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 102 [2025-02-06 18:45:21,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:23,153 INFO L124 PetriNetUnfolderBase]: 20500/36838 cut-off events. [2025-02-06 18:45:23,153 INFO L125 PetriNetUnfolderBase]: For 4768/4768 co-relation queries the response was YES. [2025-02-06 18:45:23,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68432 conditions, 36838 events. 20500/36838 cut-off events. For 4768/4768 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 329969 event pairs, 5906 based on Foata normal form. 7/34639 useless extension candidates. Maximal degree in co-relation 7603. Up to 28508 conditions per place. [2025-02-06 18:45:23,332 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 73 selfloop transitions, 4 changer transitions 0/117 dead transitions. [2025-02-06 18:45:23,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 117 transitions, 455 flow [2025-02-06 18:45:23,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:45:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:45:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 278 transitions. [2025-02-06 18:45:23,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5450980392156862 [2025-02-06 18:45:23,334 INFO L175 Difference]: Start difference. First operand has 97 places, 90 transitions, 235 flow. Second operand 5 states and 278 transitions. [2025-02-06 18:45:23,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 117 transitions, 455 flow [2025-02-06 18:45:23,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 117 transitions, 443 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:45:23,339 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 247 flow [2025-02-06 18:45:23,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2025-02-06 18:45:23,339 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 8 predicate places. [2025-02-06 18:45:23,339 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 247 flow [2025-02-06 18:45:23,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:23,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:23,340 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:23,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:45:23,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:23,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash -12539632, now seen corresponding path program 1 times [2025-02-06 18:45:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:23,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530661998] [2025-02-06 18:45:23,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:23,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 18:45:23,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:45:23,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:23,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530661998] [2025-02-06 18:45:23,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530661998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:23,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:23,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:45:23,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929736201] [2025-02-06 18:45:23,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:23,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:23,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:23,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:23,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:23,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 102 [2025-02-06 18:45:23,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:23,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:23,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 102 [2025-02-06 18:45:23,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:27,396 INFO L124 PetriNetUnfolderBase]: 37308/66712 cut-off events. [2025-02-06 18:45:27,396 INFO L125 PetriNetUnfolderBase]: For 4553/4553 co-relation queries the response was YES. [2025-02-06 18:45:27,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121439 conditions, 66712 events. 37308/66712 cut-off events. For 4553/4553 co-relation queries the response was YES. Maximal size of possible extension queue 1885. Compared 645285 event pairs, 21578 based on Foata normal form. 392/63252 useless extension candidates. Maximal degree in co-relation 85446. Up to 31483 conditions per place. [2025-02-06 18:45:27,652 INFO L140 encePairwiseOnDemand]: 96/102 looper letters, 101 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2025-02-06 18:45:27,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 143 transitions, 559 flow [2025-02-06 18:45:27,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2025-02-06 18:45:27,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2025-02-06 18:45:27,654 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 247 flow. Second operand 4 states and 264 transitions. [2025-02-06 18:45:27,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 143 transitions, 559 flow [2025-02-06 18:45:27,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 143 transitions, 553 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:45:27,658 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 265 flow [2025-02-06 18:45:27,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=265, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2025-02-06 18:45:27,658 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 10 predicate places. [2025-02-06 18:45:27,659 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 265 flow [2025-02-06 18:45:27,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:27,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:27,659 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-02-06 18:45:27,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 18:45:27,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:27,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:27,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1996158046, now seen corresponding path program 1 times [2025-02-06 18:45:27,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:27,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799634902] [2025-02-06 18:45:27,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:27,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:27,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 18:45:27,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 18:45:27,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:27,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:27,675 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:45:27,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 18:45:27,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 18:45:27,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:27,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:27,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:45:27,692 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:45:27,692 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-06 18:45:27,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-02-06 18:45:27,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-02-06 18:45:27,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-02-06 18:45:27,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-02-06 18:45:27,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-02-06 18:45:27,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-02-06 18:45:27,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-02-06 18:45:27,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-02-06 18:45:27,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-02-06 18:45:27,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-02-06 18:45:27,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:45:27,696 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 18:45:27,696 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:45:27,696 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 18:45:27,717 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 18:45:27,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 117 transitions, 274 flow [2025-02-06 18:45:27,740 INFO L124 PetriNetUnfolderBase]: 69/432 cut-off events. [2025-02-06 18:45:27,742 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-06 18:45:27,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 432 events. 69/432 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2188 event pairs, 6 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 322. Up to 32 conditions per place. [2025-02-06 18:45:27,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 117 transitions, 274 flow [2025-02-06 18:45:27,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 117 transitions, 274 flow [2025-02-06 18:45:27,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:27,747 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;@4b12e590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:27,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 18:45:27,750 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:27,751 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-06 18:45:27,751 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:27,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:27,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:27,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 18:45:27,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:27,751 INFO L85 PathProgramCache]: Analyzing trace with hash 666023989, now seen corresponding path program 1 times [2025-02-06 18:45:27,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:27,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63061336] [2025-02-06 18:45:27,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:27,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:27,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:27,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:27,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:27,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:45:27,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:27,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63061336] [2025-02-06 18:45:27,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63061336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:27,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:27,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:27,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378976053] [2025-02-06 18:45:27,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:27,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:27,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:27,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:27,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:27,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 117 [2025-02-06 18:45:27,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 117 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:27,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:27,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 117 [2025-02-06 18:45:27,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand