./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.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_OAT_test4-3.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 bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:58:23,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:58:23,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 14:58:23,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:58:23,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:58:23,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:58:23,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:58:23,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:58:23,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:58:23,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:58:23,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:58:23,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:58:23,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:58:23,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:58:23,166 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:58:23,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:58:23,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:58:23,167 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 14:58:23,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:58:23,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 14:58:23,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:58:23,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:58:23,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:58:23,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:58:23,168 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:58:23,168 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:58:23,168 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 14:58:23,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:58:23,168 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:58:23,168 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:58:23,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:58:23,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:58:23,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:58:23,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:58:23,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:58:23,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:58:23,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:58:23,169 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:58:23,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:58:23,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:58:23,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:58:23,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:58:23,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:58:23,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:58:23,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:58:23,170 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 -> bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e [2025-03-04 14:58:23,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:58:23,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:58:23,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:58:23,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:58:23,423 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:58:23,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2025-03-04 14:58:24,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed7bf5d1/82f2dc1e904b466baff1a276266f37ec/FLAGc9f10ec23 [2025-03-04 14:58:24,918 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:58:24,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2025-03-04 14:58:24,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed7bf5d1/82f2dc1e904b466baff1a276266f37ec/FLAGc9f10ec23 [2025-03-04 14:58:25,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed7bf5d1/82f2dc1e904b466baff1a276266f37ec [2025-03-04 14:58:25,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:58:25,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:58:25,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:58:25,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:58:25,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:58:25,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:58:25" (1/1) ... [2025-03-04 14:58:25,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53474d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:25, skipping insertion in model container [2025-03-04 14:58:25,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:58:25" (1/1) ... [2025-03-04 14:58:25,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:58:25,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:58:25,648 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:58:25,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:58:25,772 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:58:25,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:25 WrapperNode [2025-03-04 14:58:25,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:58:25,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:58:25,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:58:25,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:58:25,778 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:58:25" (1/1) ... [2025-03-04 14:58:25,798 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:58:25" (1/1) ... [2025-03-04 14:58:25,856 INFO L138 Inliner]: procedures = 176, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1855 [2025-03-04 14:58:25,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:58:25,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:58:25,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:58:25,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:58:25,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:25" (1/1) ... [2025-03-04 14:58:25,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:25" (1/1) ... [2025-03-04 14:58:25,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:25" (1/1) ... [2025-03-04 14:58:26,002 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2025-03-04 14:58:26,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:25" (1/1) ... [2025-03-04 14:58:26,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:25" (1/1) ... [2025-03-04 14:58:26,048 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:25" (1/1) ... [2025-03-04 14:58:26,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:25" (1/1) ... [2025-03-04 14:58:26,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:25" (1/1) ... [2025-03-04 14:58:26,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:25" (1/1) ... [2025-03-04 14:58:26,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:58:26,075 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:58:26,075 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:58:26,075 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:58:26,076 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:25" (1/1) ... [2025-03-04 14:58:26,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:58:26,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:26,105 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:58:26,111 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:58:26,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:58:26,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:58:26,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 14:58:26,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 14:58:26,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:58:26,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:58:26,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:58:26,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:58:26,129 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:58:26,129 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:58:26,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:58:26,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:58:26,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:58:26,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:58:26,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:58:26,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:58:26,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:58:26,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:58:26,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:58:26,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:58:26,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:58:26,301 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:58:26,303 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:58:27,836 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2025-03-04 14:58:27,836 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:58:27,882 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:58:27,886 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 14:58:27,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:58:27 BoogieIcfgContainer [2025-03-04 14:58:27,886 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:58:27,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:58:27,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:58:27,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:58:27,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:58:25" (1/3) ... [2025-03-04 14:58:27,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4860141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:58:27, skipping insertion in model container [2025-03-04 14:58:27,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:25" (2/3) ... [2025-03-04 14:58:27,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4860141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:58:27, skipping insertion in model container [2025-03-04 14:58:27,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:58:27" (3/3) ... [2025-03-04 14:58:27,893 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-3.i [2025-03-04 14:58:27,903 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:58:27,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test4-3.i that has 4 procedures, 492 locations, 1 initial locations, 43 loop locations, and 6 error locations. [2025-03-04 14:58:27,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:58:27,961 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;@21981958, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:58:27,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 14:58:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 488 states, 463 states have (on average 1.6241900647948164) internal successors, (752), 479 states have internal predecessors, (752), 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:58:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 14:58:27,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:27,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 14:58:27,972 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:58:27,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:27,977 INFO L85 PathProgramCache]: Analyzing trace with hash 831463792, now seen corresponding path program 1 times [2025-03-04 14:58:27,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:27,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425124859] [2025-03-04 14:58:27,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:27,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:28,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 14:58:28,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 14:58:28,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:28,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:28,138 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:58:28,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:28,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425124859] [2025-03-04 14:58:28,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425124859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:28,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:28,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:58:28,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754628467] [2025-03-04 14:58:28,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:28,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:58:28,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:28,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:58:28,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:58:28,163 INFO L87 Difference]: Start difference. First operand has 488 states, 463 states have (on average 1.6241900647948164) internal successors, (752), 479 states have internal predecessors, (752), 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) 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:58:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:28,399 INFO L93 Difference]: Finished difference Result 1352 states and 2193 transitions. [2025-03-04 14:58:28,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:58:28,401 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:58:28,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:28,412 INFO L225 Difference]: With dead ends: 1352 [2025-03-04 14:58:28,412 INFO L226 Difference]: Without dead ends: 802 [2025-03-04 14:58:28,418 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:58:28,421 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 541 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:28,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1338 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:58:28,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-03-04 14:58:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 427. [2025-03-04 14:58:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 404 states have (on average 1.4579207920792079) internal successors, (589), 418 states have internal predecessors, (589), 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:58:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 621 transitions. [2025-03-04 14:58:28,470 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 621 transitions. Word has length 5 [2025-03-04 14:58:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:28,471 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 621 transitions. [2025-03-04 14:58:28,471 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:58:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 621 transitions. [2025-03-04 14:58:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 14:58:28,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:28,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:28,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:58:28,478 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:58:28,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:28,478 INFO L85 PathProgramCache]: Analyzing trace with hash -792384770, now seen corresponding path program 1 times [2025-03-04 14:58:28,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:28,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012784560] [2025-03-04 14:58:28,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:28,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 14:58:28,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 14:58:28,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:28,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:28,985 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:58:28,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:28,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012784560] [2025-03-04 14:58:28,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012784560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:28,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:28,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:58:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759755371] [2025-03-04 14:58:28,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:28,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:58:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:28,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:58:28,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:58:28,988 INFO L87 Difference]: Start difference. First operand 427 states and 621 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:58:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:29,152 INFO L93 Difference]: Finished difference Result 850 states and 1238 transitions. [2025-03-04 14:58:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:58:29,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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 147 [2025-03-04 14:58:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:29,156 INFO L225 Difference]: With dead ends: 850 [2025-03-04 14:58:29,156 INFO L226 Difference]: Without dead ends: 430 [2025-03-04 14:58:29,157 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:58:29,157 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 105 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:29,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1551 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-04 14:58:29,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2025-03-04 14:58:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 404 states have (on average 1.4405940594059405) internal successors, (582), 418 states have internal predecessors, (582), 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:58:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 614 transitions. [2025-03-04 14:58:29,178 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 614 transitions. Word has length 147 [2025-03-04 14:58:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:29,178 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 614 transitions. [2025-03-04 14:58:29,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:58:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 614 transitions. [2025-03-04 14:58:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 14:58:29,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:29,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:29,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 14:58:29,183 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:58:29,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:29,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1892840956, now seen corresponding path program 1 times [2025-03-04 14:58:29,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:29,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793441058] [2025-03-04 14:58:29,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:29,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:29,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 14:58:29,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 14:58:29,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:29,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:29,425 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:58:29,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793441058] [2025-03-04 14:58:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793441058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:58:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509547368] [2025-03-04 14:58:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:29,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:58:29,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:29,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:58:29,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:58:29,428 INFO L87 Difference]: Start difference. First operand 427 states and 614 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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:58:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:29,570 INFO L93 Difference]: Finished difference Result 972 states and 1406 transitions. [2025-03-04 14:58:29,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:58:29,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 147 [2025-03-04 14:58:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:29,573 INFO L225 Difference]: With dead ends: 972 [2025-03-04 14:58:29,573 INFO L226 Difference]: Without dead ends: 552 [2025-03-04 14:58:29,574 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:58:29,575 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 134 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:29,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1121 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-04 14:58:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-04 14:58:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 529 states have (on average 1.448015122873346) internal successors, (766), 543 states have internal predecessors, (766), 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:58:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 798 transitions. [2025-03-04 14:58:29,592 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 798 transitions. Word has length 147 [2025-03-04 14:58:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:29,592 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 798 transitions. [2025-03-04 14:58:29,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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:58:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 798 transitions. [2025-03-04 14:58:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 14:58:29,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:29,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:29,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:58:29,594 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:58:29,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1471364511, now seen corresponding path program 1 times [2025-03-04 14:58:29,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:29,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389497372] [2025-03-04 14:58:29,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:29,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:29,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 14:58:29,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 14:58:29,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:29,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:29,899 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:58:29,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:29,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389497372] [2025-03-04 14:58:29,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389497372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:29,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:29,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:58:29,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304781158] [2025-03-04 14:58:29,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:29,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:58:29,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:29,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:58:29,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:58:29,902 INFO L87 Difference]: Start difference. First operand 552 states and 798 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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:58:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:30,032 INFO L93 Difference]: Finished difference Result 975 states and 1408 transitions. [2025-03-04 14:58:30,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:58:30,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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 162 [2025-03-04 14:58:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:30,035 INFO L225 Difference]: With dead ends: 975 [2025-03-04 14:58:30,035 INFO L226 Difference]: Without dead ends: 555 [2025-03-04 14:58:30,036 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:58:30,036 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 105 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:30,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1530 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-04 14:58:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 552. [2025-03-04 14:58:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 529 states have (on average 1.434782608695652) internal successors, (759), 543 states have internal predecessors, (759), 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:58:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 791 transitions. [2025-03-04 14:58:30,052 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 791 transitions. Word has length 162 [2025-03-04 14:58:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:30,052 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 791 transitions. [2025-03-04 14:58:30,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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:58:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 791 transitions. [2025-03-04 14:58:30,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 14:58:30,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:30,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:30,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:58:30,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:30,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:30,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1437659066, now seen corresponding path program 1 times [2025-03-04 14:58:30,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:30,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587122559] [2025-03-04 14:58:30,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:30,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:30,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 14:58:30,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 14:58:30,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:30,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:30,274 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:58:30,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:30,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587122559] [2025-03-04 14:58:30,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587122559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:30,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:30,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:58:30,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875078479] [2025-03-04 14:58:30,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:30,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:58:30,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:30,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:58:30,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:58:30,277 INFO L87 Difference]: Start difference. First operand 552 states and 791 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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:58:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:30,378 INFO L93 Difference]: Finished difference Result 978 states and 1400 transitions. [2025-03-04 14:58:30,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:58:30,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 162 [2025-03-04 14:58:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:30,381 INFO L225 Difference]: With dead ends: 978 [2025-03-04 14:58:30,381 INFO L226 Difference]: Without dead ends: 558 [2025-03-04 14:58:30,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:58:30,383 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 1 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:30,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1082 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-04 14:58:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2025-03-04 14:58:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 535 states have (on average 1.4299065420560748) internal successors, (765), 549 states have internal predecessors, (765), 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:58:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 797 transitions. [2025-03-04 14:58:30,398 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 797 transitions. Word has length 162 [2025-03-04 14:58:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:30,398 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 797 transitions. [2025-03-04 14:58:30,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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:58:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 797 transitions. [2025-03-04 14:58:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 14:58:30,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:30,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:30,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 14:58:30,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:30,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:30,402 INFO L85 PathProgramCache]: Analyzing trace with hash 468078043, now seen corresponding path program 1 times [2025-03-04 14:58:30,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:30,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789572689] [2025-03-04 14:58:30,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:30,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:30,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 14:58:30,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 14:58:30,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:30,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:30,643 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:58:30,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:30,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789572689] [2025-03-04 14:58:30,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789572689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:30,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:30,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:58:30,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579647564] [2025-03-04 14:58:30,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:30,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:58:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:30,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:58:30,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:58:30,646 INFO L87 Difference]: Start difference. First operand 558 states and 797 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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:58:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:30,779 INFO L93 Difference]: Finished difference Result 1175 states and 1674 transitions. [2025-03-04 14:58:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:58:30,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 162 [2025-03-04 14:58:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:30,784 INFO L225 Difference]: With dead ends: 1175 [2025-03-04 14:58:30,784 INFO L226 Difference]: Without dead ends: 749 [2025-03-04 14:58:30,785 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:58:30,785 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 318 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:30,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1106 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-03-04 14:58:30,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2025-03-04 14:58:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 723 states have (on average 1.4232365145228216) internal successors, (1029), 737 states have internal predecessors, (1029), 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:58:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1067 transitions. [2025-03-04 14:58:30,806 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1067 transitions. Word has length 162 [2025-03-04 14:58:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:30,806 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1067 transitions. [2025-03-04 14:58:30,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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:58:30,806 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1067 transitions. [2025-03-04 14:58:30,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 14:58:30,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:30,809 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:30,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:58:30,809 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:30,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash 13995377, now seen corresponding path program 1 times [2025-03-04 14:58:30,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:30,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62474255] [2025-03-04 14:58:30,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:30,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 14:58:30,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 14:58:30,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:30,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:31,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:31,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62474255] [2025-03-04 14:58:31,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62474255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:31,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:31,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:58:31,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265023543] [2025-03-04 14:58:31,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:31,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:58:31,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:31,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:58:31,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:58:31,118 INFO L87 Difference]: Start difference. First operand 749 states and 1067 transitions. Second operand has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:31,250 INFO L93 Difference]: Finished difference Result 814 states and 1152 transitions. [2025-03-04 14:58:31,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:58:31,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 177 [2025-03-04 14:58:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:31,253 INFO L225 Difference]: With dead ends: 814 [2025-03-04 14:58:31,254 INFO L226 Difference]: Without dead ends: 812 [2025-03-04 14:58:31,254 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:58:31,254 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 369 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:31,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1647 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-03-04 14:58:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2025-03-04 14:58:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 783 states have (on average 1.4125159642401022) internal successors, (1106), 797 states have internal predecessors, (1106), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 14:58:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1150 transitions. [2025-03-04 14:58:31,275 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1150 transitions. Word has length 177 [2025-03-04 14:58:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:31,276 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1150 transitions. [2025-03-04 14:58:31,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1150 transitions. [2025-03-04 14:58:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 14:58:31,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:31,278 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:31,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:58:31,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:31,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1472523758, now seen corresponding path program 1 times [2025-03-04 14:58:31,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:31,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19417654] [2025-03-04 14:58:31,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:31,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:31,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 14:58:31,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 14:58:31,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:31,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:31,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:31,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19417654] [2025-03-04 14:58:31,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19417654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:31,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198662529] [2025-03-04 14:58:31,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:31,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:31,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:31,597 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:58:31,599 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:58:31,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 14:58:32,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 14:58:32,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:32,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:32,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:58:32,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:32,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:58:32,453 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:32,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198662529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:58:32,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:58:32,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 14:58:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036520919] [2025-03-04 14:58:32,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:58:32,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 14:58:32,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:32,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 14:58:32,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:58:32,456 INFO L87 Difference]: Start difference. First operand 812 states and 1150 transitions. Second operand has 10 states, 10 states have (on average 47.9) internal successors, (479), 10 states have internal predecessors, (479), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 14:58:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:32,732 INFO L93 Difference]: Finished difference Result 1233 states and 1754 transitions. [2025-03-04 14:58:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:58:32,732 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 47.9) internal successors, (479), 10 states have internal predecessors, (479), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 181 [2025-03-04 14:58:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:32,737 INFO L225 Difference]: With dead ends: 1233 [2025-03-04 14:58:32,737 INFO L226 Difference]: Without dead ends: 1201 [2025-03-04 14:58:32,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 357 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:58:32,738 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 2818 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2832 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:32,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2832 Valid, 2842 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:58:32,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2025-03-04 14:58:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1201. [2025-03-04 14:58:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1166 states have (on average 1.4108061749571184) internal successors, (1645), 1180 states have internal predecessors, (1645), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 14:58:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1701 transitions. [2025-03-04 14:58:32,774 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1701 transitions. Word has length 181 [2025-03-04 14:58:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:32,775 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1701 transitions. [2025-03-04 14:58:32,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 47.9) internal successors, (479), 10 states have internal predecessors, (479), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 14:58:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1701 transitions. [2025-03-04 14:58:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-04 14:58:32,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:32,777 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:32,785 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:58:32,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:32,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:32,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:32,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1611167485, now seen corresponding path program 1 times [2025-03-04 14:58:32,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:32,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576263965] [2025-03-04 14:58:32,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:32,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:33,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-04 14:58:33,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-04 14:58:33,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:33,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:58:33,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:33,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576263965] [2025-03-04 14:58:33,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576263965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:33,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374584921] [2025-03-04 14:58:33,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:33,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:33,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:33,637 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:58:33,638 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:58:33,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-04 14:58:34,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-04 14:58:34,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:34,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:34,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 14:58:34,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:34,121 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:58:34,145 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:58:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:34,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:58:34,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374584921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:34,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:58:34,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-03-04 14:58:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691459020] [2025-03-04 14:58:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:34,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 14:58:34,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:34,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 14:58:34,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:58:34,809 INFO L87 Difference]: Start difference. First operand 1201 states and 1701 transitions. Second operand has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:36,437 INFO L93 Difference]: Finished difference Result 2365 states and 3344 transitions. [2025-03-04 14:58:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 14:58:36,439 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 183 [2025-03-04 14:58:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:36,443 INFO L225 Difference]: With dead ends: 2365 [2025-03-04 14:58:36,443 INFO L226 Difference]: Without dead ends: 1249 [2025-03-04 14:58:36,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-03-04 14:58:36,445 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 1018 mSDsluCounter, 2522 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 3075 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:36,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 3075 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 14:58:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-03-04 14:58:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1226. [2025-03-04 14:58:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1191 states have (on average 1.4063811922753988) internal successors, (1675), 1205 states have internal predecessors, (1675), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 14:58:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1731 transitions. [2025-03-04 14:58:36,481 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1731 transitions. Word has length 183 [2025-03-04 14:58:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:36,482 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1731 transitions. [2025-03-04 14:58:36,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1731 transitions. [2025-03-04 14:58:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 14:58:36,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:36,484 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:36,494 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:58:36,685 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,SelfDestructingSolverStorable8 [2025-03-04 14:58:36,685 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:36,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:36,685 INFO L85 PathProgramCache]: Analyzing trace with hash 630313026, now seen corresponding path program 1 times [2025-03-04 14:58:36,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:36,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501168392] [2025-03-04 14:58:36,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:36,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:36,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 14:58:37,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 14:58:37,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:37,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:58:37,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501168392] [2025-03-04 14:58:37,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501168392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765047606] [2025-03-04 14:58:37,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:37,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:37,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:37,328 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:58:37,329 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:58:37,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 14:58:37,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 14:58:37,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:37,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:37,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 14:58:37,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:37,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:58:37,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765047606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:37,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:58:37,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 14:58:37,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078766318] [2025-03-04 14:58:37,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:37,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:58:37,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:37,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:58:37,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:58:37,837 INFO L87 Difference]: Start difference. First operand 1226 states and 1731 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:38,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:38,056 INFO L93 Difference]: Finished difference Result 2419 states and 3416 transitions. [2025-03-04 14:58:38,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:58:38,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-04 14:58:38,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:38,061 INFO L225 Difference]: With dead ends: 2419 [2025-03-04 14:58:38,061 INFO L226 Difference]: Without dead ends: 1303 [2025-03-04 14:58:38,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:58:38,063 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 17 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:38,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1484 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:58:38,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2025-03-04 14:58:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1279. [2025-03-04 14:58:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1244 states have (on average 1.3987138263665595) internal successors, (1740), 1258 states have internal predecessors, (1740), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 14:58:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1796 transitions. [2025-03-04 14:58:38,085 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1796 transitions. Word has length 184 [2025-03-04 14:58:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:38,085 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 1796 transitions. [2025-03-04 14:58:38,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1796 transitions. [2025-03-04 14:58:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 14:58:38,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:38,097 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:38,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 14:58:38,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:38,298 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:38,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:38,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1636051200, now seen corresponding path program 1 times [2025-03-04 14:58:38,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:38,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168724509] [2025-03-04 14:58:38,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:38,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:38,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 14:58:38,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 14:58:38,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:38,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:38,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:38,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168724509] [2025-03-04 14:58:38,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168724509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:38,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:38,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:58:38,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983997499] [2025-03-04 14:58:38,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:38,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:58:38,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:38,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:58:38,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:58:38,626 INFO L87 Difference]: Start difference. First operand 1279 states and 1796 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:39,083 INFO L93 Difference]: Finished difference Result 2462 states and 3463 transitions. [2025-03-04 14:58:39,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:58:39,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-03-04 14:58:39,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:39,087 INFO L225 Difference]: With dead ends: 2462 [2025-03-04 14:58:39,087 INFO L226 Difference]: Without dead ends: 1297 [2025-03-04 14:58:39,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:58:39,089 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 8 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2273 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:39,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2273 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:58:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2025-03-04 14:58:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1291. [2025-03-04 14:58:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1256 states have (on average 1.3972929936305734) internal successors, (1755), 1270 states have internal predecessors, (1755), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 14:58:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1811 transitions. [2025-03-04 14:58:39,117 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1811 transitions. Word has length 185 [2025-03-04 14:58:39,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:39,117 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1811 transitions. [2025-03-04 14:58:39,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1811 transitions. [2025-03-04 14:58:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 14:58:39,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:39,120 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:39,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:58:39,120 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:39,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1955276098, now seen corresponding path program 1 times [2025-03-04 14:58:39,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:39,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000845946] [2025-03-04 14:58:39,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:39,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 14:58:39,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 14:58:39,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:39,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:39,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:39,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000845946] [2025-03-04 14:58:39,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000845946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:39,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:39,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 14:58:39,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610675731] [2025-03-04 14:58:39,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:39,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:58:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:39,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:58:39,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:58:39,442 INFO L87 Difference]: Start difference. First operand 1291 states and 1811 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:39,936 INFO L93 Difference]: Finished difference Result 2490 states and 3501 transitions. [2025-03-04 14:58:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:58:39,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2025-03-04 14:58:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:39,941 INFO L225 Difference]: With dead ends: 2490 [2025-03-04 14:58:39,941 INFO L226 Difference]: Without dead ends: 1324 [2025-03-04 14:58:39,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:58:39,943 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 12 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:39,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2699 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 14:58:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2025-03-04 14:58:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1315. [2025-03-04 14:58:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1280 states have (on average 1.396875) internal successors, (1788), 1294 states have internal predecessors, (1788), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 14:58:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1844 transitions. [2025-03-04 14:58:39,967 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1844 transitions. Word has length 186 [2025-03-04 14:58:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:39,967 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 1844 transitions. [2025-03-04 14:58:39,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1844 transitions. [2025-03-04 14:58:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 14:58:39,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:39,970 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:39,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 14:58:39,971 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:39,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:39,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1347357958, now seen corresponding path program 1 times [2025-03-04 14:58:39,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:39,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621069871] [2025-03-04 14:58:39,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:39,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:40,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 14:58:40,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 14:58:40,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:40,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:58:40,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:40,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621069871] [2025-03-04 14:58:40,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621069871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:40,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391318430] [2025-03-04 14:58:40,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:40,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:40,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:40,324 INFO L229 MonitoredProcess]: Starting monitored process 5 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:58:40,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:58:40,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 14:58:40,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 14:58:40,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:40,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:40,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 14:58:40,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 14:58:40,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:58:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391318430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:40,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:58:40,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 14:58:40,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929092928] [2025-03-04 14:58:40,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:40,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:58:40,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:40,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:58:40,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:58:40,845 INFO L87 Difference]: Start difference. First operand 1315 states and 1844 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:58:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:40,951 INFO L93 Difference]: Finished difference Result 2460 states and 3467 transitions. [2025-03-04 14:58:40,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:58:40,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 186 [2025-03-04 14:58:40,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:40,958 INFO L225 Difference]: With dead ends: 2460 [2025-03-04 14:58:40,958 INFO L226 Difference]: Without dead ends: 1318 [2025-03-04 14:58:40,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:58:40,959 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 0 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:40,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1655 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-03-04 14:58:41,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1318. [2025-03-04 14:58:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1282 states have (on average 1.3970358814352575) internal successors, (1791), 1297 states have internal predecessors, (1791), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-04 14:58:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1853 transitions. [2025-03-04 14:58:41,009 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1853 transitions. Word has length 186 [2025-03-04 14:58:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:41,010 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1853 transitions. [2025-03-04 14:58:41,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:58:41,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1853 transitions. [2025-03-04 14:58:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 14:58:41,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:41,012 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:41,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 14:58:41,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:41,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:41,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:41,214 INFO L85 PathProgramCache]: Analyzing trace with hash -211805810, now seen corresponding path program 1 times [2025-03-04 14:58:41,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:41,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44947817] [2025-03-04 14:58:41,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:41,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:41,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 14:58:41,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 14:58:41,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:41,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 14:58:41,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:41,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44947817] [2025-03-04 14:58:41,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44947817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:41,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671744616] [2025-03-04 14:58:41,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:41,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:41,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:41,859 INFO L229 MonitoredProcess]: Starting monitored process 6 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:58:41,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:58:42,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 14:58:42,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 14:58:42,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:42,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:42,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 14:58:42,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:42,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:58:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 14:58:42,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671744616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:58:42,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:58:42,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 14:58:42,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587723768] [2025-03-04 14:58:42,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:58:42,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 14:58:42,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:42,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 14:58:42,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-04 14:58:42,622 INFO L87 Difference]: Start difference. First operand 1318 states and 1853 transitions. Second operand has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 14:58:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:42,788 INFO L93 Difference]: Finished difference Result 2474 states and 3503 transitions. [2025-03-04 14:58:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 14:58:42,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 190 [2025-03-04 14:58:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:42,793 INFO L225 Difference]: With dead ends: 2474 [2025-03-04 14:58:42,793 INFO L226 Difference]: Without dead ends: 1329 [2025-03-04 14:58:42,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-04 14:58:42,796 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 6 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:42,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1656 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:42,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2025-03-04 14:58:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1327. [2025-03-04 14:58:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1290 states have (on average 1.3992248062015504) internal successors, (1805), 1305 states have internal predecessors, (1805), 28 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-04 14:58:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1867 transitions. [2025-03-04 14:58:42,821 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1867 transitions. Word has length 190 [2025-03-04 14:58:42,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:42,821 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1867 transitions. [2025-03-04 14:58:42,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 14:58:42,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1867 transitions. [2025-03-04 14:58:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-04 14:58:42,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:42,823 INFO L218 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:42,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 14:58:43,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 14:58:43,024 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:43,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash -643743674, now seen corresponding path program 2 times [2025-03-04 14:58:43,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:43,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282033610] [2025-03-04 14:58:43,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:58:43,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:43,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 198 statements into 2 equivalence classes. [2025-03-04 14:58:43,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 14:58:43,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:58:43,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 14:58:43,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:43,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282033610] [2025-03-04 14:58:43,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282033610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:43,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742258261] [2025-03-04 14:58:43,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:58:43,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:43,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:43,844 INFO L229 MonitoredProcess]: Starting monitored process 7 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:58:43,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:58:44,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 198 statements into 2 equivalence classes. [2025-03-04 14:58:44,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 14:58:44,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:58:44,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:44,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 14:58:44,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 84 proven. 25 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-04 14:58:44,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:58:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 22 proven. 31 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-04 14:58:44,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742258261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:58:44,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:58:44,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 19 [2025-03-04 14:58:44,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942249925] [2025-03-04 14:58:44,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:58:44,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 14:58:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:44,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 14:58:44,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-04 14:58:44,640 INFO L87 Difference]: Start difference. First operand 1327 states and 1867 transitions. Second operand has 19 states, 19 states have (on average 10.421052631578947) internal successors, (198), 19 states have internal predecessors, (198), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 14:58:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:45,193 INFO L93 Difference]: Finished difference Result 2383 states and 3377 transitions. [2025-03-04 14:58:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 14:58:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.421052631578947) internal successors, (198), 19 states have internal predecessors, (198), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 198 [2025-03-04 14:58:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:45,197 INFO L225 Difference]: With dead ends: 2383 [2025-03-04 14:58:45,197 INFO L226 Difference]: Without dead ends: 1099 [2025-03-04 14:58:45,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 14:58:45,199 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 41 mSDsluCounter, 5116 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 5589 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:45,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 5589 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:58:45,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-03-04 14:58:45,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1097. [2025-03-04 14:58:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1060 states have (on average 1.3820754716981132) internal successors, (1465), 1075 states have internal predecessors, (1465), 28 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-04 14:58:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1527 transitions. [2025-03-04 14:58:45,217 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1527 transitions. Word has length 198 [2025-03-04 14:58:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:45,218 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1527 transitions. [2025-03-04 14:58:45,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.421052631578947) internal successors, (198), 19 states have internal predecessors, (198), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 14:58:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1527 transitions. [2025-03-04 14:58:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-04 14:58:45,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:45,219 INFO L218 NwaCegarLoop]: trace histogram [26, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:45,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 14:58:45,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 14:58:45,420 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:45,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:45,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1895902196, now seen corresponding path program 3 times [2025-03-04 14:58:45,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:45,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761130055] [2025-03-04 14:58:45,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 14:58:45,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:45,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 212 statements into 14 equivalence classes. [2025-03-04 14:58:45,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 95 of 212 statements. [2025-03-04 14:58:45,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 14:58:45,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2025-03-04 14:58:45,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:45,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761130055] [2025-03-04 14:58:45,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761130055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:45,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:45,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 14:58:45,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866828258] [2025-03-04 14:58:45,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:45,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:58:45,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:45,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:58:45,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:58:45,651 INFO L87 Difference]: Start difference. First operand 1097 states and 1527 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:46,031 INFO L93 Difference]: Finished difference Result 2155 states and 3012 transitions. [2025-03-04 14:58:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:58:46,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 212 [2025-03-04 14:58:46,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:46,036 INFO L225 Difference]: With dead ends: 2155 [2025-03-04 14:58:46,036 INFO L226 Difference]: Without dead ends: 1112 [2025-03-04 14:58:46,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:58:46,038 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 12 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:46,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2558 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:58:46,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-03-04 14:58:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1097. [2025-03-04 14:58:46,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1060 states have (on average 1.3820754716981132) internal successors, (1465), 1075 states have internal predecessors, (1465), 28 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-04 14:58:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1527 transitions. [2025-03-04 14:58:46,058 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1527 transitions. Word has length 212 [2025-03-04 14:58:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:46,058 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1527 transitions. [2025-03-04 14:58:46,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1527 transitions. [2025-03-04 14:58:46,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-04 14:58:46,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:46,060 INFO L218 NwaCegarLoop]: trace histogram [26, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:46,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:58:46,061 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:46,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:46,061 INFO L85 PathProgramCache]: Analyzing trace with hash -389184737, now seen corresponding path program 1 times [2025-03-04 14:58:46,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:46,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009334542] [2025-03-04 14:58:46,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:46,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:46,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-04 14:58:46,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 14:58:46,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:46,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2025-03-04 14:58:46,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:46,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009334542] [2025-03-04 14:58:46,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009334542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:46,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:46,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 14:58:46,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145689677] [2025-03-04 14:58:46,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:46,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 14:58:46,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:46,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 14:58:46,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 14:58:46,485 INFO L87 Difference]: Start difference. First operand 1097 states and 1527 transitions. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:46,794 INFO L93 Difference]: Finished difference Result 2165 states and 3022 transitions. [2025-03-04 14:58:46,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 14:58:46,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 213 [2025-03-04 14:58:46,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:46,798 INFO L225 Difference]: With dead ends: 2165 [2025-03-04 14:58:46,798 INFO L226 Difference]: Without dead ends: 1127 [2025-03-04 14:58:46,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 14:58:46,800 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 20 mSDsluCounter, 2974 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:46,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3447 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:58:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-03-04 14:58:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1118. [2025-03-04 14:58:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1081 states have (on average 1.3802035152636447) internal successors, (1492), 1096 states have internal predecessors, (1492), 28 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-04 14:58:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1554 transitions. [2025-03-04 14:58:46,817 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1554 transitions. Word has length 213 [2025-03-04 14:58:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:46,817 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1554 transitions. [2025-03-04 14:58:46,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1554 transitions. [2025-03-04 14:58:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-04 14:58:46,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:46,818 INFO L218 NwaCegarLoop]: trace histogram [26, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:46,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 14:58:46,818 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:58:46,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2045649879, now seen corresponding path program 1 times [2025-03-04 14:58:46,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:46,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953192846] [2025-03-04 14:58:46,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:46,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:46,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-04 14:58:47,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 14:58:47,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:47,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 5 proven. 165 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-04 14:58:47,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:47,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953192846] [2025-03-04 14:58:47,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953192846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:47,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478019673] [2025-03-04 14:58:47,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:47,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:47,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:47,736 INFO L229 MonitoredProcess]: Starting monitored process 8 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:58:47,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:58:48,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-04 14:58:48,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 14:58:48,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:48,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:48,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 214 conjuncts are in the unsatisfiable core [2025-03-04 14:58:48,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:48,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 14:58:48,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:58:48,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-04 14:58:48,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-04 14:58:48,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 14:58:48,979 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 14:58:48,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-04 14:58:48,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 14:58:49,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 14:58:49,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 14:58:49,234 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 14:58:49,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-04 14:58:49,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16