./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:51:37,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:51:37,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 14:51:37,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:51:37,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:51:37,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:51:37,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:51:37,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:51:37,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:51:37,321 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:51:37,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:51:37,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:51:37,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:51:37,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:51:37,322 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:51:37,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:51:37,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:51:37,322 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 14:51:37,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:51:37,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 14:51:37,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:51:37,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:51:37,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:51:37,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:51:37,323 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:51:37,323 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:51:37,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 14:51:37,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:51:37,323 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:51:37,323 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:51:37,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:51:37,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:51:37,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:51:37,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:51:37,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:51:37,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:51:37,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:51:37,324 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:51:37,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:51:37,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:51:37,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:51:37,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:51:37,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:51:37,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:51:37,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:51:37,325 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f [2025-03-04 14:51:37,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:51:37,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:51:37,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:51:37,561 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:51:37,561 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:51:37,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i [2025-03-04 14:51:38,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009aa11e4/eda09d051a3143a39b7ffb3811c496eb/FLAG3998b9890 [2025-03-04 14:51:38,984 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:51:38,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i [2025-03-04 14:51:38,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009aa11e4/eda09d051a3143a39b7ffb3811c496eb/FLAG3998b9890 [2025-03-04 14:51:39,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009aa11e4/eda09d051a3143a39b7ffb3811c496eb [2025-03-04 14:51:39,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:51:39,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:51:39,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:51:39,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:51:39,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:51:39,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466ec0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39, skipping insertion in model container [2025-03-04 14:51:39,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:51:39,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:51:39,592 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:51:39,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:51:39,673 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:51:39,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39 WrapperNode [2025-03-04 14:51:39,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:51:39,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:51:39,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:51:39,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:51:39,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,723 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 823 [2025-03-04 14:51:39,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:51:39,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:51:39,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:51:39,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:51:39,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,767 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-03-04 14:51:39,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:51:39,812 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:51:39,812 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:51:39,812 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:51:39,813 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39" (1/1) ... [2025-03-04 14:51:39,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:51:39,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:51:39,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:51:39,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:51:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:51:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:51:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 14:51:39,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:51:39,858 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:51:39,858 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:51:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:51:39,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:51:39,970 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:51:39,971 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:51:40,667 INFO L? ?]: Removed 214 outVars from TransFormulas that were not future-live. [2025-03-04 14:51:40,669 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:51:40,702 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:51:40,702 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 14:51:40,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:51:40 BoogieIcfgContainer [2025-03-04 14:51:40,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:51:40,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:51:40,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:51:40,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:51:40,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:51:39" (1/3) ... [2025-03-04 14:51:40,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3170f62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:51:40, skipping insertion in model container [2025-03-04 14:51:40,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:51:39" (2/3) ... [2025-03-04 14:51:40,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3170f62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:51:40, skipping insertion in model container [2025-03-04 14:51:40,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:51:40" (3/3) ... [2025-03-04 14:51:40,711 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test1-1.i [2025-03-04 14:51:40,720 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:51:40,721 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test1-1.i that has 4 procedures, 245 locations, 1 initial locations, 19 loop locations, and 6 error locations. [2025-03-04 14:51:40,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:51:40,775 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;@692f48a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:51:40,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 14:51:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 219 states have (on average 1.6210045662100456) internal successors, (355), 235 states have internal predecessors, (355), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:51:40,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 14:51:40,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:51:40,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 14:51:40,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:51:40,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:51:40,787 INFO L85 PathProgramCache]: Analyzing trace with hash 425252587, now seen corresponding path program 1 times [2025-03-04 14:51:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:51:40,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506101047] [2025-03-04 14:51:40,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:51:40,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:51:40,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 14:51:40,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 14:51:40,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:51:40,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:51:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:51:40,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:51:40,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506101047] [2025-03-04 14:51:40,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506101047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:51:40,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:51:40,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:51:40,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138630347] [2025-03-04 14:51:40,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:51:40,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:51:40,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:51:40,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:51:40,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:51:40,959 INFO L87 Difference]: Start difference. First operand has 241 states, 219 states have (on average 1.6210045662100456) internal successors, (355), 235 states have internal predecessors, (355), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:51:41,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:51:41,098 INFO L93 Difference]: Finished difference Result 671 states and 1083 transitions. [2025-03-04 14:51:41,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:51:41,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2025-03-04 14:51:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:51:41,106 INFO L225 Difference]: With dead ends: 671 [2025-03-04 14:51:41,106 INFO L226 Difference]: Without dead ends: 428 [2025-03-04 14:51:41,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:51:41,110 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 273 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:51:41,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 633 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:51:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-04 14:51:41,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 240. [2025-03-04 14:51:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 220 states have (on average 1.459090909090909) internal successors, (321), 234 states have internal predecessors, (321), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:51:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 347 transitions. [2025-03-04 14:51:41,162 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 347 transitions. Word has length 5 [2025-03-04 14:51:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:51:41,162 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 347 transitions. [2025-03-04 14:51:41,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:51:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 347 transitions. [2025-03-04 14:51:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 14:51:41,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:51:41,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:51:41,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:51:41,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:51:41,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:51:41,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1375245523, now seen corresponding path program 1 times [2025-03-04 14:51:41,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:51:41,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343305854] [2025-03-04 14:51:41,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:51:41,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:51:41,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 14:51:41,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 14:51:41,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:51:41,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:51:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:51:41,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:51:41,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343305854] [2025-03-04 14:51:41,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343305854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:51:41,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:51:41,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:51:41,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799838598] [2025-03-04 14:51:41,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:51:41,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:51:41,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:51:41,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:51:41,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:51:41,517 INFO L87 Difference]: Start difference. First operand 240 states and 347 transitions. 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-03-04 14:51:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:51:41,614 INFO L93 Difference]: Finished difference Result 476 states and 690 transitions. [2025-03-04 14:51:41,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:51:41,614 INFO L78 Accepts]: Start accepts. 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) Word has length 78 [2025-03-04 14:51:41,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:51:41,616 INFO L225 Difference]: With dead ends: 476 [2025-03-04 14:51:41,616 INFO L226 Difference]: Without dead ends: 243 [2025-03-04 14:51:41,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:51:41,617 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 105 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:51:41,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 795 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:51:41,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-04 14:51:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2025-03-04 14:51:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 220 states have (on average 1.4272727272727272) internal successors, (314), 234 states have internal predecessors, (314), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:51:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 340 transitions. [2025-03-04 14:51:41,633 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 340 transitions. Word has length 78 [2025-03-04 14:51:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:51:41,634 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 340 transitions. [2025-03-04 14:51:41,634 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-03-04 14:51:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 340 transitions. [2025-03-04 14:51:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 14:51:41,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:51:41,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:51:41,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 14:51:41,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:51:41,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:51:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash -953341721, now seen corresponding path program 1 times [2025-03-04 14:51:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:51:41,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590910335] [2025-03-04 14:51:41,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:51:41,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:51:41,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 14:51:41,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 14:51:41,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:51:41,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:51:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:51:41,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:51:41,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590910335] [2025-03-04 14:51:41,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590910335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:51:41,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:51:41,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:51:41,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433389355] [2025-03-04 14:51:41,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:51:41,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:51:41,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:51:41,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:51:41,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:51:41,789 INFO L87 Difference]: Start difference. First operand 240 states and 340 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-03-04 14:51:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:51:41,896 INFO L93 Difference]: Finished difference Result 598 states and 858 transitions. [2025-03-04 14:51:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:51:41,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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) Word has length 78 [2025-03-04 14:51:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:51:41,899 INFO L225 Difference]: With dead ends: 598 [2025-03-04 14:51:41,900 INFO L226 Difference]: Without dead ends: 365 [2025-03-04 14:51:41,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:51:41,903 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 134 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:51:41,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 616 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:51:41,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-04 14:51:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-03-04 14:51:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 345 states have (on average 1.4434782608695653) internal successors, (498), 359 states have internal predecessors, (498), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:51:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 524 transitions. [2025-03-04 14:51:41,929 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 524 transitions. Word has length 78 [2025-03-04 14:51:41,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:51:41,929 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 524 transitions. [2025-03-04 14:51:41,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-03-04 14:51:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 524 transitions. [2025-03-04 14:51:41,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 14:51:41,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:51:41,931 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:51:41,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:51:41,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:51:41,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:51:41,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1533184064, now seen corresponding path program 1 times [2025-03-04 14:51:41,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:51:41,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798007883] [2025-03-04 14:51:41,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:51:41,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:51:41,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 14:51:42,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 14:51:42,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:51:42,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:51:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:51:42,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:51:42,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798007883] [2025-03-04 14:51:42,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798007883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:51:42,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:51:42,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:51:42,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261462945] [2025-03-04 14:51:42,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:51:42,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:51:42,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:51:42,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:51:42,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:51:42,205 INFO L87 Difference]: Start difference. First operand 365 states and 524 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:51:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:51:42,300 INFO L93 Difference]: Finished difference Result 430 states and 609 transitions. [2025-03-04 14:51:42,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:51:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2025-03-04 14:51:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:51:42,303 INFO L225 Difference]: With dead ends: 430 [2025-03-04 14:51:42,303 INFO L226 Difference]: Without dead ends: 428 [2025-03-04 14:51:42,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:51:42,304 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 185 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:51:42,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 990 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:51:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-04 14:51:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-03-04 14:51:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 405 states have (on average 1.4197530864197532) internal successors, (575), 419 states have internal predecessors, (575), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:51:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 607 transitions. [2025-03-04 14:51:42,317 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 607 transitions. Word has length 93 [2025-03-04 14:51:42,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:51:42,318 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 607 transitions. [2025-03-04 14:51:42,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:51:42,318 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 607 transitions. [2025-03-04 14:51:42,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 14:51:42,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:51:42,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:51:42,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:51:42,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:51:42,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:51:42,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1515083907, now seen corresponding path program 1 times [2025-03-04 14:51:42,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:51:42,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512593916] [2025-03-04 14:51:42,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:51:42,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:51:42,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 14:51:42,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 14:51:42,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:51:42,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:51:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:51:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:51:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512593916] [2025-03-04 14:51:42,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512593916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:51:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257162137] [2025-03-04 14:51:42,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:51:42,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:51:42,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:51:42,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:51:42,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:51:42,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 14:51:42,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 14:51:42,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:51:42,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:51:42,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:51:42,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:51:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:51:42,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:51:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:51:43,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257162137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:51:43,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:51:43,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 14:51:43,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971629750] [2025-03-04 14:51:43,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:51:43,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 14:51:43,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:51:43,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 14:51:43,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:51:43,075 INFO L87 Difference]: Start difference. First operand 428 states and 607 transitions. Second operand has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 14:51:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:51:43,228 INFO L93 Difference]: Finished difference Result 656 states and 938 transitions. [2025-03-04 14:51:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:51:43,229 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 97 [2025-03-04 14:51:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:51:43,231 INFO L225 Difference]: With dead ends: 656 [2025-03-04 14:51:43,231 INFO L226 Difference]: Without dead ends: 624 [2025-03-04 14:51:43,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:51:43,232 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 1274 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:51:43,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 1287 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:51:43,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-04 14:51:43,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2025-03-04 14:51:43,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 598 states have (on average 1.4163879598662208) internal successors, (847), 612 states have internal predecessors, (847), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 14:51:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 885 transitions. [2025-03-04 14:51:43,264 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 885 transitions. Word has length 97 [2025-03-04 14:51:43,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:51:43,264 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 885 transitions. [2025-03-04 14:51:43,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 14:51:43,265 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 885 transitions. [2025-03-04 14:51:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 14:51:43,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:51:43,266 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:51:43,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:51:43,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:51:43,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:51:43,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:51:43,468 INFO L85 PathProgramCache]: Analyzing trace with hash 320835117, now seen corresponding path program 1 times [2025-03-04 14:51:43,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:51:43,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579893078] [2025-03-04 14:51:43,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:51:43,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:51:43,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 14:51:43,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 14:51:43,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:51:43,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:51:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:51:43,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:51:43,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579893078] [2025-03-04 14:51:43,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579893078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:51:43,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073421951] [2025-03-04 14:51:43,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:51:43,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:51:43,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:51:43,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:51:43,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:51:43,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 14:51:44,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 14:51:44,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:51:44,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:51:44,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 14:51:44,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:51:44,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 14:51:44,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 14:51:44,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 14:51:44,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 58 [2025-03-04 14:51:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:51:44,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:51:44,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073421951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:51:44,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:51:44,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-03-04 14:51:44,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080129180] [2025-03-04 14:51:44,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:51:44,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 14:51:44,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:51:44,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 14:51:44,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:51:44,720 INFO L87 Difference]: Start difference. First operand 624 states and 885 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:51:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:51:46,970 INFO L93 Difference]: Finished difference Result 1211 states and 1712 transitions. [2025-03-04 14:51:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 14:51:46,973 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-03-04 14:51:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:51:46,976 INFO L225 Difference]: With dead ends: 1211 [2025-03-04 14:51:46,976 INFO L226 Difference]: Without dead ends: 672 [2025-03-04 14:51:46,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-03-04 14:51:46,977 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 536 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:51:46,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 2505 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 14:51:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-04 14:51:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 649. [2025-03-04 14:51:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 623 states have (on average 1.4077046548956662) internal successors, (877), 637 states have internal predecessors, (877), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 14:51:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 915 transitions. [2025-03-04 14:51:46,994 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 915 transitions. Word has length 99 [2025-03-04 14:51:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:51:46,994 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 915 transitions. [2025-03-04 14:51:46,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:51:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 915 transitions. [2025-03-04 14:51:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 14:51:46,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:51:46,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:51:47,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:51:47,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 14:51:47,199 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:51:47,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:51:47,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1261566762, now seen corresponding path program 1 times [2025-03-04 14:51:47,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:51:47,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744025674] [2025-03-04 14:51:47,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:51:47,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:51:47,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 14:51:47,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 14:51:47,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:51:47,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:51:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:51:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:51:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744025674] [2025-03-04 14:51:47,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744025674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:51:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187081047] [2025-03-04 14:51:47,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:51:47,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:51:47,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:51:47,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:51:47,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:51:47,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 14:51:47,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 14:51:47,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:51:47,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:51:47,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 14:51:47,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:52:08,038 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 14:53:09,283 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 14:53:21,313 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)