./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_17-ps_add1_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/04-mutex_17-ps_add1_nr.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 013bb91f520a17a9cdc0cfee70ba812e0f5d104f38897431df1c1d9fa0ad9ebb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:43:47,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:43:47,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:43:47,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:43:47,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:43:47,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:43:47,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:43:47,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:43:47,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:43:47,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:43:47,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:43:47,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:43:47,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:43:47,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:43:47,911 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:43:47,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:43:47,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:43:47,912 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:43:47,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:43:47,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:43:47,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:43:47,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:43:47,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:43:47,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:43:47,912 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:43:47,912 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:43:47,912 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:43:47,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:43:47,912 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:43:47,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:43:47,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:43:47,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:43:47,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:43:47,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:43:47,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:43:47,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:43:47,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:43:47,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:43:47,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:43:47,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:43:47,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:43:47,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:43:47,913 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:43:47,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:43:47,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:43:47,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:43:47,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:43:47,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:43:47,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:43:47,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:43:47,914 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 -> 013bb91f520a17a9cdc0cfee70ba812e0f5d104f38897431df1c1d9fa0ad9ebb [2025-01-10 06:43:48,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:43:48,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:43:48,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:43:48,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:43:48,129 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:43:48,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_17-ps_add1_nr.i [2025-01-10 06:43:49,556 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81fb04cad/f53f7b131d3f49da8d2667c344a004cb/FLAG528fe9bc2 [2025-01-10 06:43:49,868 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:43:49,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_17-ps_add1_nr.i [2025-01-10 06:43:49,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81fb04cad/f53f7b131d3f49da8d2667c344a004cb/FLAG528fe9bc2 [2025-01-10 06:43:49,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81fb04cad/f53f7b131d3f49da8d2667c344a004cb [2025-01-10 06:43:49,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:43:49,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:43:49,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:43:49,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:43:49,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:43:49,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:43:49" (1/1) ... [2025-01-10 06:43:49,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab1b04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:49, skipping insertion in model container [2025-01-10 06:43:49,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:43:49" (1/1) ... [2025-01-10 06:43:49,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:43:50,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:43:50,270 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:43:50,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:43:50,365 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:43:50,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50 WrapperNode [2025-01-10 06:43:50,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:43:50,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:43:50,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:43:50,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:43:50,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (1/1) ... [2025-01-10 06:43:50,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (1/1) ... [2025-01-10 06:43:50,408 INFO L138 Inliner]: procedures = 266, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2025-01-10 06:43:50,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:43:50,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:43:50,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:43:50,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:43:50,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (1/1) ... [2025-01-10 06:43:50,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (1/1) ... [2025-01-10 06:43:50,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (1/1) ... [2025-01-10 06:43:50,424 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 100 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [5]. The 0 writes are split as follows [0]. [2025-01-10 06:43:50,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (1/1) ... [2025-01-10 06:43:50,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (1/1) ... [2025-01-10 06:43:50,427 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (1/1) ... [2025-01-10 06:43:50,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (1/1) ... [2025-01-10 06:43:50,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (1/1) ... [2025-01-10 06:43:50,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (1/1) ... [2025-01-10 06:43:50,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (1/1) ... [2025-01-10 06:43:50,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:43:50,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:43:50,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:43:50,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:43:50,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (1/1) ... [2025-01-10 06:43:50,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:43:50,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:43:50,462 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-01-10 06:43:50,465 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-01-10 06:43:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:43:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:43:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:43:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:43:50,485 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:43:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:43:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:43:50,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:43:50,486 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:43:50,574 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:43:50,576 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:43:50,711 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:43:50,711 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:43:50,777 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:43:50,778 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:43:50,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:43:50 BoogieIcfgContainer [2025-01-10 06:43:50,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:43:50,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:43:50,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:43:50,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:43:50,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:43:49" (1/3) ... [2025-01-10 06:43:50,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2f6c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:43:50, skipping insertion in model container [2025-01-10 06:43:50,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:50" (2/3) ... [2025-01-10 06:43:50,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2f6c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:43:50, skipping insertion in model container [2025-01-10 06:43:50,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:43:50" (3/3) ... [2025-01-10 06:43:50,787 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_17-ps_add1_nr.i [2025-01-10 06:43:50,804 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:43:50,806 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_17-ps_add1_nr.i that has 2 procedures, 40 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-01-10 06:43:50,806 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:43:50,853 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:43:50,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 90 flow [2025-01-10 06:43:50,898 INFO L124 PetriNetUnfolderBase]: 4/42 cut-off events. [2025-01-10 06:43:50,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:43:50,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 42 events. 4/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2025-01-10 06:43:50,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 43 transitions, 90 flow [2025-01-10 06:43:50,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 42 transitions, 87 flow [2025-01-10 06:43:50,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:43:50,920 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;@5256e9a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:43:50,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:43:50,926 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:43:50,926 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-01-10 06:43:50,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:43:50,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:50,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:43:50,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:50,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2028905339, now seen corresponding path program 1 times [2025-01-10 06:43:50,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:50,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938123781] [2025-01-10 06:43:50,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:50,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:51,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:43:51,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:43:51,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:51,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:51,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:51,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938123781] [2025-01-10 06:43:51,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938123781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:51,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:51,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:43:51,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147481699] [2025-01-10 06:43:51,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:51,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:43:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:51,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:43:51,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:43:51,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2025-01-10 06:43:51,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-01-10 06:43:51,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:51,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2025-01-10 06:43:51,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:51,326 INFO L124 PetriNetUnfolderBase]: 126/343 cut-off events. [2025-01-10 06:43:51,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:43:51,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 343 events. 126/343 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1667 event pairs, 49 based on Foata normal form. 16/299 useless extension candidates. Maximal degree in co-relation 580. Up to 115 conditions per place. [2025-01-10 06:43:51,336 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 42 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2025-01-10 06:43:51,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 241 flow [2025-01-10 06:43:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:43:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:43:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2025-01-10 06:43:51,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7488372093023256 [2025-01-10 06:43:51,392 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 87 flow. Second operand 5 states and 161 transitions. [2025-01-10 06:43:51,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 70 transitions, 241 flow [2025-01-10 06:43:51,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:43:51,402 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 134 flow [2025-01-10 06:43:51,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2025-01-10 06:43:51,412 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2025-01-10 06:43:51,412 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 134 flow [2025-01-10 06:43:51,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-01-10 06:43:51,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:51,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:51,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:43:51,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:51,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:51,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1548561092, now seen corresponding path program 1 times [2025-01-10 06:43:51,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:51,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493774850] [2025-01-10 06:43:51,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:51,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:51,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:43:51,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:43:51,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:51,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:51,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:51,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493774850] [2025-01-10 06:43:51,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493774850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:51,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:51,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:43:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666796419] [2025-01-10 06:43:51,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:51,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:43:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:51,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:43:51,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:43:51,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-01-10 06:43:51,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-01-10 06:43:51,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:51,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-01-10 06:43:51,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:51,700 INFO L124 PetriNetUnfolderBase]: 198/565 cut-off events. [2025-01-10 06:43:51,700 INFO L125 PetriNetUnfolderBase]: For 218/220 co-relation queries the response was YES. [2025-01-10 06:43:51,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 565 events. 198/565 cut-off events. For 218/220 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3325 event pairs, 76 based on Foata normal form. 14/511 useless extension candidates. Maximal degree in co-relation 1129. Up to 223 conditions per place. [2025-01-10 06:43:51,704 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 49 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2025-01-10 06:43:51,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 350 flow [2025-01-10 06:43:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:43:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:43:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2025-01-10 06:43:51,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.641860465116279 [2025-01-10 06:43:51,705 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 134 flow. Second operand 5 states and 138 transitions. [2025-01-10 06:43:51,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 350 flow [2025-01-10 06:43:51,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 350 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:43:51,708 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 205 flow [2025-01-10 06:43:51,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2025-01-10 06:43:51,709 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2025-01-10 06:43:51,709 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 205 flow [2025-01-10 06:43:51,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-01-10 06:43:51,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:51,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:51,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:43:51,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:51,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:51,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1528443698, now seen corresponding path program 1 times [2025-01-10 06:43:51,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:51,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63390728] [2025-01-10 06:43:51,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:51,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:51,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:43:51,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:43:51,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:51,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:51,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:51,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63390728] [2025-01-10 06:43:51,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63390728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:51,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:51,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:43:51,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609562762] [2025-01-10 06:43:51,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:51,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:43:51,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:51,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:43:51,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:43:51,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2025-01-10 06:43:51,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-01-10 06:43:51,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:51,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2025-01-10 06:43:51,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:51,871 INFO L124 PetriNetUnfolderBase]: 156/463 cut-off events. [2025-01-10 06:43:51,872 INFO L125 PetriNetUnfolderBase]: For 374/387 co-relation queries the response was YES. [2025-01-10 06:43:51,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 463 events. 156/463 cut-off events. For 374/387 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2604 event pairs, 40 based on Foata normal form. 32/471 useless extension candidates. Maximal degree in co-relation 1089. Up to 214 conditions per place. [2025-01-10 06:43:51,875 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 47 selfloop transitions, 7 changer transitions 11/89 dead transitions. [2025-01-10 06:43:51,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 89 transitions, 471 flow [2025-01-10 06:43:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:43:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:43:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2025-01-10 06:43:51,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7674418604651163 [2025-01-10 06:43:51,878 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 205 flow. Second operand 5 states and 165 transitions. [2025-01-10 06:43:51,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 89 transitions, 471 flow [2025-01-10 06:43:51,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:43:51,882 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 216 flow [2025-01-10 06:43:51,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2025-01-10 06:43:51,883 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2025-01-10 06:43:51,883 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 216 flow [2025-01-10 06:43:51,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-01-10 06:43:51,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:51,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:51,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:43:51,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:51,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:51,884 INFO L85 PathProgramCache]: Analyzing trace with hash -760776123, now seen corresponding path program 1 times [2025-01-10 06:43:51,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:51,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484234762] [2025-01-10 06:43:51,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:51,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:51,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:43:51,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:43:51,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:51,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:51,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:51,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484234762] [2025-01-10 06:43:51,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484234762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:51,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:51,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:43:51,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209966133] [2025-01-10 06:43:51,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:51,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:43:51,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:51,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:43:51,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:43:51,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-01-10 06:43:51,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-01-10 06:43:51,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:51,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-01-10 06:43:51,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:52,054 INFO L124 PetriNetUnfolderBase]: 187/553 cut-off events. [2025-01-10 06:43:52,055 INFO L125 PetriNetUnfolderBase]: For 575/578 co-relation queries the response was YES. [2025-01-10 06:43:52,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 553 events. 187/553 cut-off events. For 575/578 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3239 event pairs, 91 based on Foata normal form. 9/526 useless extension candidates. Maximal degree in co-relation 1392. Up to 243 conditions per place. [2025-01-10 06:43:52,057 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 34 selfloop transitions, 9 changer transitions 6/65 dead transitions. [2025-01-10 06:43:52,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 372 flow [2025-01-10 06:43:52,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:43:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:43:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-01-10 06:43:52,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2025-01-10 06:43:52,059 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 216 flow. Second operand 4 states and 104 transitions. [2025-01-10 06:43:52,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 372 flow [2025-01-10 06:43:52,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 65 transitions, 356 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 06:43:52,061 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 222 flow [2025-01-10 06:43:52,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2025-01-10 06:43:52,062 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2025-01-10 06:43:52,062 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 222 flow [2025-01-10 06:43:52,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-01-10 06:43:52,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:52,063 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:52,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:43:52,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:52,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:52,063 INFO L85 PathProgramCache]: Analyzing trace with hash -760753380, now seen corresponding path program 1 times [2025-01-10 06:43:52,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:52,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764308177] [2025-01-10 06:43:52,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:52,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:52,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:43:52,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:43:52,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:52,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:52,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:52,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764308177] [2025-01-10 06:43:52,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764308177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:52,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:52,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:43:52,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976069738] [2025-01-10 06:43:52,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:52,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:43:52,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:52,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:43:52,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:43:52,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-01-10 06:43:52,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-01-10 06:43:52,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:52,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-01-10 06:43:52,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:52,203 INFO L124 PetriNetUnfolderBase]: 177/523 cut-off events. [2025-01-10 06:43:52,203 INFO L125 PetriNetUnfolderBase]: For 574/578 co-relation queries the response was YES. [2025-01-10 06:43:52,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 523 events. 177/523 cut-off events. For 574/578 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3072 event pairs, 104 based on Foata normal form. 7/495 useless extension candidates. Maximal degree in co-relation 1354. Up to 304 conditions per place. [2025-01-10 06:43:52,206 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 40 selfloop transitions, 6 changer transitions 2/64 dead transitions. [2025-01-10 06:43:52,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 368 flow [2025-01-10 06:43:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:43:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:43:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-01-10 06:43:52,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6162790697674418 [2025-01-10 06:43:52,209 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 222 flow. Second operand 4 states and 106 transitions. [2025-01-10 06:43:52,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 368 flow [2025-01-10 06:43:52,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 64 transitions, 350 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:43:52,214 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 212 flow [2025-01-10 06:43:52,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2025-01-10 06:43:52,217 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2025-01-10 06:43:52,217 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 212 flow [2025-01-10 06:43:52,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-01-10 06:43:52,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:52,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:52,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:43:52,218 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:52,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:52,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2109223117, now seen corresponding path program 1 times [2025-01-10 06:43:52,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:52,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244962656] [2025-01-10 06:43:52,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:52,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:43:52,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:43:52,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:52,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:52,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:52,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244962656] [2025-01-10 06:43:52,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244962656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:52,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:52,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:43:52,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842841514] [2025-01-10 06:43:52,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:52,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:43:52,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:52,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:43:52,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:43:52,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-01-10 06:43:52,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-01-10 06:43:52,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:52,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-01-10 06:43:52,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:52,407 INFO L124 PetriNetUnfolderBase]: 165/490 cut-off events. [2025-01-10 06:43:52,407 INFO L125 PetriNetUnfolderBase]: For 511/520 co-relation queries the response was YES. [2025-01-10 06:43:52,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 490 events. 165/490 cut-off events. For 511/520 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2843 event pairs, 63 based on Foata normal form. 19/479 useless extension candidates. Maximal degree in co-relation 1243. Up to 187 conditions per place. [2025-01-10 06:43:52,410 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 34 selfloop transitions, 12 changer transitions 9/71 dead transitions. [2025-01-10 06:43:52,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 404 flow [2025-01-10 06:43:52,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:43:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:43:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-01-10 06:43:52,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5906976744186047 [2025-01-10 06:43:52,411 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 212 flow. Second operand 5 states and 127 transitions. [2025-01-10 06:43:52,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 404 flow [2025-01-10 06:43:52,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 397 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:43:52,414 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 224 flow [2025-01-10 06:43:52,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2025-01-10 06:43:52,415 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2025-01-10 06:43:52,415 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 224 flow [2025-01-10 06:43:52,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-01-10 06:43:52,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:52,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:52,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:43:52,416 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:52,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash -961407001, now seen corresponding path program 1 times [2025-01-10 06:43:52,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625208736] [2025-01-10 06:43:52,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:52,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:43:52,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:43:52,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:52,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:52,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:52,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625208736] [2025-01-10 06:43:52,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625208736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:52,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:52,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:43:52,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977577074] [2025-01-10 06:43:52,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:52,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:43:52,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:52,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:43:52,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:43:52,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2025-01-10 06:43:52,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-01-10 06:43:52,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:52,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2025-01-10 06:43:52,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:52,671 INFO L124 PetriNetUnfolderBase]: 152/485 cut-off events. [2025-01-10 06:43:52,672 INFO L125 PetriNetUnfolderBase]: For 590/593 co-relation queries the response was YES. [2025-01-10 06:43:52,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 485 events. 152/485 cut-off events. For 590/593 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2794 event pairs, 27 based on Foata normal form. 9/462 useless extension candidates. Maximal degree in co-relation 1238. Up to 187 conditions per place. [2025-01-10 06:43:52,674 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 39 selfloop transitions, 10 changer transitions 4/68 dead transitions. [2025-01-10 06:43:52,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 401 flow [2025-01-10 06:43:52,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:43:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:43:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-01-10 06:43:52,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5503875968992248 [2025-01-10 06:43:52,676 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 224 flow. Second operand 6 states and 142 transitions. [2025-01-10 06:43:52,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 401 flow [2025-01-10 06:43:52,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 68 transitions, 387 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:43:52,678 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 222 flow [2025-01-10 06:43:52,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2025-01-10 06:43:52,679 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2025-01-10 06:43:52,679 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 222 flow [2025-01-10 06:43:52,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-01-10 06:43:52,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:52,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:52,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:43:52,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:52,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash -966232886, now seen corresponding path program 1 times [2025-01-10 06:43:52,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:52,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702355791] [2025-01-10 06:43:52,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:52,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:52,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:43:52,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:43:52,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:52,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:52,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:52,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702355791] [2025-01-10 06:43:52,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702355791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:52,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:52,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:43:52,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607620528] [2025-01-10 06:43:52,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:52,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:43:52,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:52,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:43:52,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:43:52,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2025-01-10 06:43:52,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-01-10 06:43:52,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:52,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2025-01-10 06:43:52,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:52,835 INFO L124 PetriNetUnfolderBase]: 177/531 cut-off events. [2025-01-10 06:43:52,836 INFO L125 PetriNetUnfolderBase]: For 752/762 co-relation queries the response was YES. [2025-01-10 06:43:52,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1410 conditions, 531 events. 177/531 cut-off events. For 752/762 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3220 event pairs, 43 based on Foata normal form. 22/523 useless extension candidates. Maximal degree in co-relation 1388. Up to 132 conditions per place. [2025-01-10 06:43:52,838 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 41 selfloop transitions, 10 changer transitions 14/83 dead transitions. [2025-01-10 06:43:52,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 521 flow [2025-01-10 06:43:52,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:43:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:43:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-01-10 06:43:52,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2025-01-10 06:43:52,840 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 222 flow. Second operand 5 states and 160 transitions. [2025-01-10 06:43:52,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 521 flow [2025-01-10 06:43:52,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 477 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 06:43:52,845 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 268 flow [2025-01-10 06:43:52,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2025-01-10 06:43:52,847 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2025-01-10 06:43:52,847 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 268 flow [2025-01-10 06:43:52,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-01-10 06:43:52,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:52,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:52,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:43:52,847 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:52,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash 111551815, now seen corresponding path program 1 times [2025-01-10 06:43:52,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:52,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794694622] [2025-01-10 06:43:52,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:52,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:52,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:43:52,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:43:52,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:52,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:52,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:52,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794694622] [2025-01-10 06:43:52,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794694622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:52,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:52,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:43:52,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450227743] [2025-01-10 06:43:52,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:52,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:43:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:52,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:43:52,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:43:52,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2025-01-10 06:43:52,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-01-10 06:43:52,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:52,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2025-01-10 06:43:52,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:52,976 INFO L124 PetriNetUnfolderBase]: 147/479 cut-off events. [2025-01-10 06:43:52,977 INFO L125 PetriNetUnfolderBase]: For 799/806 co-relation queries the response was YES. [2025-01-10 06:43:52,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1306 conditions, 479 events. 147/479 cut-off events. For 799/806 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2918 event pairs, 76 based on Foata normal form. 18/467 useless extension candidates. Maximal degree in co-relation 1280. Up to 153 conditions per place. [2025-01-10 06:43:52,979 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 39 selfloop transitions, 9 changer transitions 3/69 dead transitions. [2025-01-10 06:43:52,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 435 flow [2025-01-10 06:43:52,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:43:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:43:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-01-10 06:43:52,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162790697674418 [2025-01-10 06:43:52,980 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 268 flow. Second operand 5 states and 154 transitions. [2025-01-10 06:43:52,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 435 flow [2025-01-10 06:43:52,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 69 transitions, 430 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:43:52,983 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 277 flow [2025-01-10 06:43:52,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2025-01-10 06:43:52,983 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2025-01-10 06:43:52,983 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 277 flow [2025-01-10 06:43:52,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-01-10 06:43:52,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:52,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:52,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:43:52,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:52,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:52,984 INFO L85 PathProgramCache]: Analyzing trace with hash 111550298, now seen corresponding path program 1 times [2025-01-10 06:43:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:52,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314069390] [2025-01-10 06:43:52,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:52,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:52,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:43:52,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:43:52,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:52,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:53,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:53,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314069390] [2025-01-10 06:43:53,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314069390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:53,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:53,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:43:53,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066207746] [2025-01-10 06:43:53,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:53,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:43:53,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:53,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:43:53,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:43:53,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-01-10 06:43:53,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-01-10 06:43:53,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:53,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-01-10 06:43:53,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:53,130 INFO L124 PetriNetUnfolderBase]: 214/614 cut-off events. [2025-01-10 06:43:53,130 INFO L125 PetriNetUnfolderBase]: For 1175/1179 co-relation queries the response was YES. [2025-01-10 06:43:53,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 614 events. 214/614 cut-off events. For 1175/1179 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3800 event pairs, 146 based on Foata normal form. 8/608 useless extension candidates. Maximal degree in co-relation 1706. Up to 394 conditions per place. [2025-01-10 06:43:53,132 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 50 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2025-01-10 06:43:53,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 467 flow [2025-01-10 06:43:53,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:43:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:43:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-01-10 06:43:53,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.586046511627907 [2025-01-10 06:43:53,133 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 277 flow. Second operand 5 states and 126 transitions. [2025-01-10 06:43:53,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 467 flow [2025-01-10 06:43:53,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 68 transitions, 449 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 06:43:53,136 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 288 flow [2025-01-10 06:43:53,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2025-01-10 06:43:53,137 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2025-01-10 06:43:53,137 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 288 flow [2025-01-10 06:43:53,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-01-10 06:43:53,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:53,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:53,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:43:53,137 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:53,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:53,138 INFO L85 PathProgramCache]: Analyzing trace with hash -836907864, now seen corresponding path program 1 times [2025-01-10 06:43:53,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:53,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583714935] [2025-01-10 06:43:53,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:53,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:53,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:43:53,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:43:53,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:53,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:53,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:53,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583714935] [2025-01-10 06:43:53,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583714935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:53,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:53,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:43:53,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411370697] [2025-01-10 06:43:53,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:53,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:43:53,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:53,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:43:53,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:43:53,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-01-10 06:43:53,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 52 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-01-10 06:43:53,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:53,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-01-10 06:43:53,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:53,280 INFO L124 PetriNetUnfolderBase]: 209/607 cut-off events. [2025-01-10 06:43:53,280 INFO L125 PetriNetUnfolderBase]: For 1261/1266 co-relation queries the response was YES. [2025-01-10 06:43:53,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1824 conditions, 607 events. 209/607 cut-off events. For 1261/1266 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3829 event pairs, 124 based on Foata normal form. 7/604 useless extension candidates. Maximal degree in co-relation 1796. Up to 344 conditions per place. [2025-01-10 06:43:53,283 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 41 selfloop transitions, 5 changer transitions 10/70 dead transitions. [2025-01-10 06:43:53,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 70 transitions, 492 flow [2025-01-10 06:43:53,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:43:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:43:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-01-10 06:43:53,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5953488372093023 [2025-01-10 06:43:53,284 INFO L175 Difference]: Start difference. First operand has 73 places, 52 transitions, 288 flow. Second operand 5 states and 128 transitions. [2025-01-10 06:43:53,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 70 transitions, 492 flow [2025-01-10 06:43:53,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 492 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:43:53,287 INFO L231 Difference]: Finished difference. Result has 77 places, 48 transitions, 266 flow [2025-01-10 06:43:53,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=77, PETRI_TRANSITIONS=48} [2025-01-10 06:43:53,287 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2025-01-10 06:43:53,287 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 48 transitions, 266 flow [2025-01-10 06:43:53,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-01-10 06:43:53,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:53,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:53,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:43:53,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:53,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:53,288 INFO L85 PathProgramCache]: Analyzing trace with hash -172881681, now seen corresponding path program 1 times [2025-01-10 06:43:53,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:53,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117562771] [2025-01-10 06:43:53,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:53,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:53,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:43:53,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:43:53,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:53,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:53,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:53,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117562771] [2025-01-10 06:43:53,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117562771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:53,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:43:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318780896] [2025-01-10 06:43:53,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:53,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:43:53,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:53,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:43:53,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:43:53,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-01-10 06:43:53,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 48 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-01-10 06:43:53,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:53,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-01-10 06:43:53,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:53,409 INFO L124 PetriNetUnfolderBase]: 203/565 cut-off events. [2025-01-10 06:43:53,409 INFO L125 PetriNetUnfolderBase]: For 1079/1085 co-relation queries the response was YES. [2025-01-10 06:43:53,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1717 conditions, 565 events. 203/565 cut-off events. For 1079/1085 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3285 event pairs, 52 based on Foata normal form. 38/596 useless extension candidates. Maximal degree in co-relation 1699. Up to 168 conditions per place. [2025-01-10 06:43:53,411 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 39 selfloop transitions, 8 changer transitions 2/61 dead transitions. [2025-01-10 06:43:53,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 61 transitions, 431 flow [2025-01-10 06:43:53,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:43:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:43:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-01-10 06:43:53,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563953488372093 [2025-01-10 06:43:53,412 INFO L175 Difference]: Start difference. First operand has 77 places, 48 transitions, 266 flow. Second operand 4 states and 97 transitions. [2025-01-10 06:43:53,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 61 transitions, 431 flow [2025-01-10 06:43:53,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 405 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-01-10 06:43:53,415 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 250 flow [2025-01-10 06:43:53,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2025-01-10 06:43:53,416 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2025-01-10 06:43:53,416 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 250 flow [2025-01-10 06:43:53,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-01-10 06:43:53,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:53,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:53,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:43:53,417 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:53,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:53,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1064364621, now seen corresponding path program 1 times [2025-01-10 06:43:53,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:53,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786231327] [2025-01-10 06:43:53,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:53,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:53,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:43:53,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:43:53,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:53,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:53,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:53,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786231327] [2025-01-10 06:43:53,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786231327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:53,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:53,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:43:53,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264985505] [2025-01-10 06:43:53,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:53,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:43:53,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:53,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:43:53,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:43:53,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2025-01-10 06:43:53,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-01-10 06:43:53,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:53,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2025-01-10 06:43:53,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:53,531 INFO L124 PetriNetUnfolderBase]: 155/485 cut-off events. [2025-01-10 06:43:53,531 INFO L125 PetriNetUnfolderBase]: For 854/854 co-relation queries the response was YES. [2025-01-10 06:43:53,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 485 events. 155/485 cut-off events. For 854/854 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2799 event pairs, 104 based on Foata normal form. 32/511 useless extension candidates. Maximal degree in co-relation 1378. Up to 285 conditions per place. [2025-01-10 06:43:53,533 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 25 selfloop transitions, 6 changer transitions 12/56 dead transitions. [2025-01-10 06:43:53,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 56 transitions, 370 flow [2025-01-10 06:43:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:43:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:43:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-01-10 06:43:53,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523255813953488 [2025-01-10 06:43:53,534 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 250 flow. Second operand 4 states and 95 transitions. [2025-01-10 06:43:53,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 56 transitions, 370 flow [2025-01-10 06:43:53,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 56 transitions, 354 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:43:53,536 INFO L231 Difference]: Finished difference. Result has 65 places, 40 transitions, 188 flow [2025-01-10 06:43:53,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2025-01-10 06:43:53,536 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2025-01-10 06:43:53,536 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 188 flow [2025-01-10 06:43:53,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-01-10 06:43:53,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:53,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:53,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:43:53,537 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:53,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:53,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1562613008, now seen corresponding path program 1 times [2025-01-10 06:43:53,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:53,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491538357] [2025-01-10 06:43:53,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:53,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:53,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:43:53,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:43:53,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:53,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:53,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:53,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491538357] [2025-01-10 06:43:53,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491538357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:53,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:53,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:43:53,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174974952] [2025-01-10 06:43:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:53,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:43:53,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:53,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:43:53,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:43:53,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2025-01-10 06:43:53,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 40 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-01-10 06:43:53,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:53,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2025-01-10 06:43:53,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:53,737 INFO L124 PetriNetUnfolderBase]: 79/237 cut-off events. [2025-01-10 06:43:53,738 INFO L125 PetriNetUnfolderBase]: For 461/468 co-relation queries the response was YES. [2025-01-10 06:43:53,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 237 events. 79/237 cut-off events. For 461/468 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1093 event pairs, 19 based on Foata normal form. 13/245 useless extension candidates. Maximal degree in co-relation 678. Up to 54 conditions per place. [2025-01-10 06:43:53,739 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 44 selfloop transitions, 6 changer transitions 1/63 dead transitions. [2025-01-10 06:43:53,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 390 flow [2025-01-10 06:43:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:43:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:43:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2025-01-10 06:43:53,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2025-01-10 06:43:53,741 INFO L175 Difference]: Start difference. First operand has 65 places, 40 transitions, 188 flow. Second operand 7 states and 182 transitions. [2025-01-10 06:43:53,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 390 flow [2025-01-10 06:43:53,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 63 transitions, 340 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-01-10 06:43:53,742 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 161 flow [2025-01-10 06:43:53,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=161, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2025-01-10 06:43:53,743 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2025-01-10 06:43:53,743 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 161 flow [2025-01-10 06:43:53,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-01-10 06:43:53,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:53,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:53,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:43:53,743 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:53,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:53,744 INFO L85 PathProgramCache]: Analyzing trace with hash -532290712, now seen corresponding path program 1 times [2025-01-10 06:43:53,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:53,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201744917] [2025-01-10 06:43:53,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:53,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:43:53,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:43:53,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:53,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:53,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201744917] [2025-01-10 06:43:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201744917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:53,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:53,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:43:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899994026] [2025-01-10 06:43:53,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:53,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:43:53,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:53,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:43:53,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:43:53,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2025-01-10 06:43:53,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-01-10 06:43:53,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:53,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2025-01-10 06:43:53,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:53,919 INFO L124 PetriNetUnfolderBase]: 72/221 cut-off events. [2025-01-10 06:43:53,920 INFO L125 PetriNetUnfolderBase]: For 290/297 co-relation queries the response was YES. [2025-01-10 06:43:53,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 221 events. 72/221 cut-off events. For 290/297 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1011 event pairs, 18 based on Foata normal form. 14/231 useless extension candidates. Maximal degree in co-relation 584. Up to 56 conditions per place. [2025-01-10 06:43:53,921 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 35 selfloop transitions, 11 changer transitions 1/59 dead transitions. [2025-01-10 06:43:53,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 59 transitions, 329 flow [2025-01-10 06:43:53,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:43:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:43:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2025-01-10 06:43:53,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5710594315245479 [2025-01-10 06:43:53,922 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 161 flow. Second operand 9 states and 221 transitions. [2025-01-10 06:43:53,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 59 transitions, 329 flow [2025-01-10 06:43:53,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 306 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 06:43:53,923 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 175 flow [2025-01-10 06:43:53,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=175, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2025-01-10 06:43:53,924 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2025-01-10 06:43:53,924 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 175 flow [2025-01-10 06:43:53,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-01-10 06:43:53,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:53,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:53,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:43:53,924 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:53,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1862562995, now seen corresponding path program 1 times [2025-01-10 06:43:53,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:53,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434116129] [2025-01-10 06:43:53,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:53,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:53,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:43:53,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:43:53,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:53,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:53,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:53,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434116129] [2025-01-10 06:43:53,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434116129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:53,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:53,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:43:53,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555558546] [2025-01-10 06:43:53,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:53,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:43:53,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:53,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:43:53,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:43:53,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2025-01-10 06:43:53,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-01-10 06:43:53,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:53,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2025-01-10 06:43:53,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:54,088 INFO L124 PetriNetUnfolderBase]: 68/212 cut-off events. [2025-01-10 06:43:54,088 INFO L125 PetriNetUnfolderBase]: For 279/288 co-relation queries the response was YES. [2025-01-10 06:43:54,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 212 events. 68/212 cut-off events. For 279/288 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 961 event pairs, 15 based on Foata normal form. 11/221 useless extension candidates. Maximal degree in co-relation 546. Up to 45 conditions per place. [2025-01-10 06:43:54,089 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 20 selfloop transitions, 7 changer transitions 23/62 dead transitions. [2025-01-10 06:43:54,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 349 flow [2025-01-10 06:43:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:43:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:43:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2025-01-10 06:43:54,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5710594315245479 [2025-01-10 06:43:54,090 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 175 flow. Second operand 9 states and 221 transitions. [2025-01-10 06:43:54,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 349 flow [2025-01-10 06:43:54,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 62 transitions, 329 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-01-10 06:43:54,092 INFO L231 Difference]: Finished difference. Result has 61 places, 35 transitions, 149 flow [2025-01-10 06:43:54,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=35} [2025-01-10 06:43:54,092 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2025-01-10 06:43:54,092 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 35 transitions, 149 flow [2025-01-10 06:43:54,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-01-10 06:43:54,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:54,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:54,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:43:54,093 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:43:54,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash 678857345, now seen corresponding path program 1 times [2025-01-10 06:43:54,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:54,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401851491] [2025-01-10 06:43:54,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:54,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:54,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:43:54,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:43:54,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:54,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:43:54,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:54,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401851491] [2025-01-10 06:43:54,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401851491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:54,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:54,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:43:54,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730467196] [2025-01-10 06:43:54,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:54,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:43:54,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:54,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:43:54,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:43:54,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2025-01-10 06:43:54,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 35 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-01-10 06:43:54,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:54,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2025-01-10 06:43:54,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:54,204 INFO L124 PetriNetUnfolderBase]: 27/108 cut-off events. [2025-01-10 06:43:54,204 INFO L125 PetriNetUnfolderBase]: For 132/136 co-relation queries the response was YES. [2025-01-10 06:43:54,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 108 events. 27/108 cut-off events. For 132/136 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 338 event pairs, 7 based on Foata normal form. 11/118 useless extension candidates. Maximal degree in co-relation 255. Up to 24 conditions per place. [2025-01-10 06:43:54,204 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 0 selfloop transitions, 0 changer transitions 41/41 dead transitions. [2025-01-10 06:43:54,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 41 transitions, 220 flow [2025-01-10 06:43:54,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:43:54,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:43:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2025-01-10 06:43:54,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5377906976744186 [2025-01-10 06:43:54,205 INFO L175 Difference]: Start difference. First operand has 61 places, 35 transitions, 149 flow. Second operand 8 states and 185 transitions. [2025-01-10 06:43:54,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 41 transitions, 220 flow [2025-01-10 06:43:54,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 198 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 06:43:54,206 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2025-01-10 06:43:54,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2025-01-10 06:43:54,206 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2025-01-10 06:43:54,207 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 0 transitions, 0 flow [2025-01-10 06:43:54,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-01-10 06:43:54,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 13 remaining) [2025-01-10 06:43:54,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-01-10 06:43:54,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-01-10 06:43:54,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-01-10 06:43:54,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-01-10 06:43:54,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-01-10 06:43:54,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-01-10 06:43:54,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-01-10 06:43:54,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 13 remaining) [2025-01-10 06:43:54,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-01-10 06:43:54,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-01-10 06:43:54,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-01-10 06:43:54,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-01-10 06:43:54,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:43:54,210 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:54,214 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:43:54,214 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:43:54,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:43:54 BasicIcfg [2025-01-10 06:43:54,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:43:54,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:43:54,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:43:54,218 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:43:54,219 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:43:50" (3/4) ... [2025-01-10 06:43:54,220 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:43:54,222 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-10 06:43:54,224 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2025-01-10 06:43:54,224 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-10 06:43:54,224 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 06:43:54,273 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:43:54,273 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:43:54,273 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:43:54,274 INFO L158 Benchmark]: Toolchain (without parser) took 4359.89ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 132.7MB in the beginning and 60.9MB in the end (delta: 71.7MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. [2025-01-10 06:43:54,274 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 226.5MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:43:54,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.53ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 105.4MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 06:43:54,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.56ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 103.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:43:54,274 INFO L158 Benchmark]: Boogie Preprocessor took 22.58ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 102.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:43:54,275 INFO L158 Benchmark]: RCFGBuilder took 346.35ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 82.3MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:43:54,275 INFO L158 Benchmark]: TraceAbstraction took 3437.20ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 81.8MB in the beginning and 65.9MB in the end (delta: 15.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2025-01-10 06:43:54,275 INFO L158 Benchmark]: Witness Printer took 55.21ms. Allocated memory is still 201.3MB. Free memory was 65.9MB in the beginning and 60.9MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:43:54,276 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 226.5MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.53ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 105.4MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.56ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 103.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.58ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 102.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 346.35ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 82.3MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3437.20ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 81.8MB in the beginning and 65.9MB in the end (delta: 15.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * Witness Printer took 55.21ms. Allocated memory is still 201.3MB. Free memory was 65.9MB in the beginning and 60.9MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 947]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 947]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 948]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 948]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 949]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 951]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 949]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 951]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 932]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 932]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 51 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 756 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 590 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1525 IncrementalHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 75 mSDtfsCounter, 1525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=10, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:43:54,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE