./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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_BER_test1-2.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 98addbea2d7583a98dfe535f8a62b1da98b67168a60a4eb76b7c658a539d3a89 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:01:18,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:01:18,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:01:18,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:01:18,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:01:18,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:01:18,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:01:18,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:01:18,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:01:18,160 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:01:18,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:01:18,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:01:18,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:01:18,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:01:18,161 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:01:18,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:01:18,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:01:18,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:01:18,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:01:18,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:01:18,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:01:18,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:01:18,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:01:18,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:01:18,162 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:01:18,162 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:01:18,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:01:18,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:01:18,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:01:18,162 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:01:18,162 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:01:18,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:01:18,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:01:18,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:01:18,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:01:18,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:01:18,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:01:18,163 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:01:18,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:01:18,163 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:01:18,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:01:18,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:01:18,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:01:18,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:01:18,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:01:18,163 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 -> 98addbea2d7583a98dfe535f8a62b1da98b67168a60a4eb76b7c658a539d3a89 [2025-03-09 06:01:18,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:01:18,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:01:18,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:01:18,405 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:01:18,405 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:01:18,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i [2025-03-09 06:01:19,637 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81fbcebb/95736205cb5949c9ae41d79a0dc37f79/FLAG3637b45e1 [2025-03-09 06:01:19,963 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:01:19,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i [2025-03-09 06:01:19,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81fbcebb/95736205cb5949c9ae41d79a0dc37f79/FLAG3637b45e1 [2025-03-09 06:01:20,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81fbcebb/95736205cb5949c9ae41d79a0dc37f79 [2025-03-09 06:01:20,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:01:20,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:01:20,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:01:20,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:01:20,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:01:20,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227ec695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20, skipping insertion in model container [2025-03-09 06:01:20,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:01:20,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:01:20,617 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:01:20,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:01:20,725 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:01:20,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20 WrapperNode [2025-03-09 06:01:20,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:01:20,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:01:20,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:01:20,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:01:20,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,797 INFO L138 Inliner]: procedures = 176, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 982 [2025-03-09 06:01:20,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:01:20,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:01:20,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:01:20,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:01:20,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,886 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2025-03-09 06:01:20,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:01:20,947 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:01:20,947 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:01:20,947 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:01:20,949 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20" (1/1) ... [2025-03-09 06:01:20,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:01:20,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:01:20,975 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-09 06:01:20,978 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-09 06:01:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:01:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:01:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 06:01:20,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 06:01:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:01:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:01:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 06:01:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 06:01:20,997 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 06:01:20,997 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 06:01:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:01:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:01:20,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 06:01:20,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 06:01:20,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 06:01:20,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 06:01:20,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:01:20,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:01:20,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:01:20,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:01:20,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:01:21,150 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:01:21,152 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:01:22,170 INFO L? ?]: Removed 236 outVars from TransFormulas that were not future-live. [2025-03-09 06:01:22,170 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:01:22,208 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:01:22,208 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-09 06:01:22,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:01:22 BoogieIcfgContainer [2025-03-09 06:01:22,209 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:01:22,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:01:22,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:01:22,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:01:22,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:01:20" (1/3) ... [2025-03-09 06:01:22,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3216fdc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:01:22, skipping insertion in model container [2025-03-09 06:01:22,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:01:20" (2/3) ... [2025-03-09 06:01:22,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3216fdc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:01:22, skipping insertion in model container [2025-03-09 06:01:22,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:01:22" (3/3) ... [2025-03-09 06:01:22,223 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test1-2.i [2025-03-09 06:01:22,235 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:01:22,237 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test1-2.i that has 4 procedures, 278 locations, 1 initial locations, 24 loop locations, and 6 error locations. [2025-03-09 06:01:22,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:01:22,293 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;@35897c57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:01:22,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 06:01:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 252 states have (on average 1.623015873015873) internal successors, (409), 268 states have internal predecessors, (409), 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-09 06:01:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 06:01:22,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:01:22,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:01:22,302 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-09 06:01:22,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:01:22,306 INFO L85 PathProgramCache]: Analyzing trace with hash 477739362, now seen corresponding path program 1 times [2025-03-09 06:01:22,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:01:22,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661438414] [2025-03-09 06:01:22,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:01:22,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:01:22,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:01:22,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:01:22,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:01:22,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:01:22,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-03-09 06:01:22,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:01:22,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661438414] [2025-03-09 06:01:22,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661438414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:01:22,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:01:22,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:01:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618031622] [2025-03-09 06:01:22,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:01:22,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:01:22,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:01:22,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:01:22,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:01:22,487 INFO L87 Difference]: Start difference. First operand has 274 states, 252 states have (on average 1.623015873015873) internal successors, (409), 268 states have internal predecessors, (409), 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-09 06:01:22,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:01:22,678 INFO L93 Difference]: Finished difference Result 737 states and 1191 transitions. [2025-03-09 06:01:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:01:22,680 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-09 06:01:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:01:22,688 INFO L225 Difference]: With dead ends: 737 [2025-03-09 06:01:22,688 INFO L226 Difference]: Without dead ends: 428 [2025-03-09 06:01:22,692 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-09 06:01:22,695 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 273 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:01:22,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 762 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:01:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-09 06:01:22,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 240. [2025-03-09 06:01:22,747 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-09 06:01:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 347 transitions. [2025-03-09 06:01:22,754 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 347 transitions. Word has length 5 [2025-03-09 06:01:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:01:22,755 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 347 transitions. [2025-03-09 06:01:22,755 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-09 06:01:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 347 transitions. [2025-03-09 06:01:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 06:01:22,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:01:22,759 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-09 06:01:22,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:01:22,760 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-09 06:01:22,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:01:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1845619725, now seen corresponding path program 1 times [2025-03-09 06:01:22,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:01:22,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590189671] [2025-03-09 06:01:22,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:01:22,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:01:22,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 06:01:22,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 06:01:22,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:01:22,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:01:23,199 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-09 06:01:23,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:01:23,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590189671] [2025-03-09 06:01:23,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590189671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:01:23,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:01:23,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:01:23,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181713472] [2025-03-09 06:01:23,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:01:23,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:01:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:01:23,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:01:23,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:01:23,203 INFO L87 Difference]: Start difference. First operand 240 states and 347 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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-09 06:01:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:01:23,354 INFO L93 Difference]: Finished difference Result 476 states and 690 transitions. [2025-03-09 06:01:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:01:23,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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-09 06:01:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:01:23,357 INFO L225 Difference]: With dead ends: 476 [2025-03-09 06:01:23,357 INFO L226 Difference]: Without dead ends: 243 [2025-03-09 06:01:23,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:01:23,361 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 87 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:01:23,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1076 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:01:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-09 06:01:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2025-03-09 06:01:23,372 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-09 06:01:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 340 transitions. [2025-03-09 06:01:23,373 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 340 transitions. Word has length 78 [2025-03-09 06:01:23,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:01:23,374 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 340 transitions. [2025-03-09 06:01:23,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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-09 06:01:23,374 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 340 transitions. [2025-03-09 06:01:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 06:01:23,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:01:23,376 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-09 06:01:23,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:01:23,376 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-09 06:01:23,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:01:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2130189575, now seen corresponding path program 1 times [2025-03-09 06:01:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:01:23,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535741955] [2025-03-09 06:01:23,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:01:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:01:23,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 06:01:23,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 06:01:23,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:01:23,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:01:23,583 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-09 06:01:23,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:01:23,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535741955] [2025-03-09 06:01:23,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535741955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:01:23,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:01:23,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:01:23,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050601087] [2025-03-09 06:01:23,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:01:23,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:01:23,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:01:23,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:01:23,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:01:23,587 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-09 06:01:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:01:23,694 INFO L93 Difference]: Finished difference Result 598 states and 858 transitions. [2025-03-09 06:01:23,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:01:23,695 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-09 06:01:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:01:23,697 INFO L225 Difference]: With dead ends: 598 [2025-03-09 06:01:23,697 INFO L226 Difference]: Without dead ends: 365 [2025-03-09 06:01:23,698 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-09 06:01:23,702 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-09 06:01:23,702 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-09 06:01:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-09 06:01:23,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-03-09 06:01:23,718 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-09 06:01:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 524 transitions. [2025-03-09 06:01:23,721 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 524 transitions. Word has length 78 [2025-03-09 06:01:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:01:23,724 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 524 transitions. [2025-03-09 06:01:23,724 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-09 06:01:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 524 transitions. [2025-03-09 06:01:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 06:01:23,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:01:23,728 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-09 06:01:23,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:01:23,728 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-09 06:01:23,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:01:23,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1129189417, now seen corresponding path program 1 times [2025-03-09 06:01:23,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:01:23,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210638772] [2025-03-09 06:01:23,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:01:23,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:01:23,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 06:01:23,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 06:01:23,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:01:23,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:01:24,034 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-09 06:01:24,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:01:24,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210638772] [2025-03-09 06:01:24,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210638772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:01:24,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:01:24,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:01:24,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209698893] [2025-03-09 06:01:24,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:01:24,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:01:24,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:01:24,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:01:24,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:01:24,038 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-09 06:01:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:01:24,153 INFO L93 Difference]: Finished difference Result 430 states and 609 transitions. [2025-03-09 06:01:24,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:01:24,154 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-09 06:01:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:01:24,157 INFO L225 Difference]: With dead ends: 430 [2025-03-09 06:01:24,157 INFO L226 Difference]: Without dead ends: 428 [2025-03-09 06:01:24,157 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-09 06:01:24,158 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-09 06:01:24,158 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-09 06:01:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-09 06:01:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-03-09 06:01:24,178 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-09 06:01:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 607 transitions. [2025-03-09 06:01:24,181 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 607 transitions. Word has length 93 [2025-03-09 06:01:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:01:24,182 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 607 transitions. [2025-03-09 06:01:24,182 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-09 06:01:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 607 transitions. [2025-03-09 06:01:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 06:01:24,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:01:24,187 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-09 06:01:24,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:01:24,188 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-09 06:01:24,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:01:24,188 INFO L85 PathProgramCache]: Analyzing trace with hash 807932372, now seen corresponding path program 1 times [2025-03-09 06:01:24,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:01:24,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46682702] [2025-03-09 06:01:24,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:01:24,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:01:24,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 06:01:24,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 06:01:24,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:01:24,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:01:24,478 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-09 06:01:24,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:01:24,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46682702] [2025-03-09 06:01:24,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46682702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:01:24,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676446596] [2025-03-09 06:01:24,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:01:24,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:01:24,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:01:24,482 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-09 06:01:24,484 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-09 06:01:24,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 06:01:24,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 06:01:24,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:01:24,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:01:24,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:01:24,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:01:24,847 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-09 06:01:24,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:01:25,021 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-09 06:01:25,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676446596] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:01:25,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:01:25,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 06:01:25,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416468786] [2025-03-09 06:01:25,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:01:25,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:01:25,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:01:25,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:01:25,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:01:25,026 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-09 06:01:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:01:25,252 INFO L93 Difference]: Finished difference Result 656 states and 938 transitions. [2025-03-09 06:01:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:01:25,253 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-09 06:01:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:01:25,256 INFO L225 Difference]: With dead ends: 656 [2025-03-09 06:01:25,259 INFO L226 Difference]: Without dead ends: 624 [2025-03-09 06:01:25,260 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-09 06:01:25,261 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 903 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:01:25,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 2242 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:01:25,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-09 06:01:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2025-03-09 06:01:25,287 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-09 06:01:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 885 transitions. [2025-03-09 06:01:25,289 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 885 transitions. Word has length 97 [2025-03-09 06:01:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:01:25,290 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 885 transitions. [2025-03-09 06:01:25,290 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-09 06:01:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 885 transitions. [2025-03-09 06:01:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-09 06:01:25,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:01:25,292 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-09 06:01:25,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:01:25,496 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-09 06:01:25,496 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-09 06:01:25,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:01:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash -643512924, now seen corresponding path program 1 times [2025-03-09 06:01:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:01:25,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739226979] [2025-03-09 06:01:25,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:01:25,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:01:25,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-09 06:01:25,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-09 06:01:25,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:01:25,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:01:25,902 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-09 06:01:25,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:01:25,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739226979] [2025-03-09 06:01:25,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739226979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:01:25,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918907752] [2025-03-09 06:01:25,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:01:25,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:01:25,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:01:25,906 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-09 06:01:25,907 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-09 06:01:26,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-09 06:01:26,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-09 06:01:26,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:01:26,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:01:26,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 06:01:26,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:01:26,176 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-09 06:01:26,194 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 27 treesize of output 11 [2025-03-09 06:01:26,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:01:26,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-03-09 06:01:26,889 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-09 06:01:26,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:01:26,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918907752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:01:26,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:01:26,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-09 06:01:26,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601887403] [2025-03-09 06:01:26,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:01:26,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 06:01:26,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:01:26,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:01:26,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:01:26,892 INFO L87 Difference]: Start difference. First operand 624 states and 885 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-09 06:01:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:01:28,994 INFO L93 Difference]: Finished difference Result 1211 states and 1712 transitions. [2025-03-09 06:01:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:01:28,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-09 06:01:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:01:29,000 INFO L225 Difference]: With dead ends: 1211 [2025-03-09 06:01:29,001 INFO L226 Difference]: Without dead ends: 672 [2025-03-09 06:01:29,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-03-09 06:01:29,003 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 543 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-09 06:01:29,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 2069 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-09 06:01:29,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-09 06:01:29,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 649. [2025-03-09 06:01:29,023 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-09 06:01:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 915 transitions. [2025-03-09 06:01:29,026 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 915 transitions. Word has length 99 [2025-03-09 06:01:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:01:29,027 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 915 transitions. [2025-03-09 06:01:29,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-09 06:01:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 915 transitions. [2025-03-09 06:01:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 06:01:29,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:01:29,032 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-09 06:01:29,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 06:01:29,233 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-09 06:01:29,233 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-09 06:01:29,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:01:29,234 INFO L85 PathProgramCache]: Analyzing trace with hash 563122358, now seen corresponding path program 1 times [2025-03-09 06:01:29,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:01:29,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923955740] [2025-03-09 06:01:29,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:01:29,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:01:29,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 06:01:29,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 06:01:29,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:01:29,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:01:29,508 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-09 06:01:29,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:01:29,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923955740] [2025-03-09 06:01:29,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923955740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:01:29,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784870035] [2025-03-09 06:01:29,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:01:29,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:01:29,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:01:29,511 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-09 06:01:29,513 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-09 06:01:29,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 06:01:29,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 06:01:29,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:01:29,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:01:29,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 06:01:29,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:01:55,282 WARN L286 SmtUtils]: Spent 8.90s 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-09 06:02:07,076 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-09 06:02:50,105 WARN L286 SmtUtils]: Spent 6.52s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)