./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-lopstr16/flag_loopdep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-lopstr16/flag_loopdep.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea0eb860624f2529729bf06b2cf9cdf66fc11dde388f7654e825b0ff58526d73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:51:29,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:51:29,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 08:51:29,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:51:29,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:51:29,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:51:29,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:51:29,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:51:29,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:51:29,607 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:51:29,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:51:29,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:51:29,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:51:29,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:51:29,608 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:51:29,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:51:29,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:51:29,609 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:51:29,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:51:29,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:51:29,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:51:29,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:51:29,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:51:29,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:51:29,609 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:51:29,609 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:51:29,610 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:51:29,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:51:29,610 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:51:29,610 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:51:29,610 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:51:29,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:51:29,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:51:29,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:51:29,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:51:29,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:51:29,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:51:29,611 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:51:29,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:51:29,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:51:29,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:51:29,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:51:29,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:51:29,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:51:29,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:51:29,612 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea0eb860624f2529729bf06b2cf9cdf66fc11dde388f7654e825b0ff58526d73 [2025-02-08 08:51:29,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:51:29,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:51:29,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:51:29,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:51:29,896 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:51:29,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2025-02-08 08:51:31,093 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b359c4772/fbae4a0f75534c3da17a6b497740f8dc/FLAG95e35a6e3 [2025-02-08 08:51:31,338 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:51:31,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2025-02-08 08:51:31,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b359c4772/fbae4a0f75534c3da17a6b497740f8dc/FLAG95e35a6e3 [2025-02-08 08:51:31,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b359c4772/fbae4a0f75534c3da17a6b497740f8dc [2025-02-08 08:51:31,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:51:31,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:51:31,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:51:31,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:51:31,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:51:31,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505924de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31, skipping insertion in model container [2025-02-08 08:51:31,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:51:31,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:51:31,793 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:51:31,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:51:31,814 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:51:31,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31 WrapperNode [2025-02-08 08:51:31,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:51:31,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:51:31,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:51:31,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:51:31,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,848 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 61 [2025-02-08 08:51:31,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:51:31,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:51:31,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:51:31,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:51:31,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,871 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 08:51:31,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:51:31,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:51:31,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:51:31,879 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:51:31,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31" (1/1) ... [2025-02-08 08:51:31,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:51:31,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:31,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:51:31,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:51:31,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 08:51:31,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 08:51:31,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:51:31,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:51:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:51:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:51:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 08:51:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 08:51:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:51:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:51:31,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:51:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:51:31,981 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:51:31,983 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:51:32,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-02-08 08:51:32,152 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-08 08:51:32,154 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:51:32,160 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:51:32,162 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:51:32,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:32 BoogieIcfgContainer [2025-02-08 08:51:32,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:51:32,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:51:32,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:51:32,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:51:32,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:51:31" (1/3) ... [2025-02-08 08:51:32,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1260548c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:51:32, skipping insertion in model container [2025-02-08 08:51:32,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:31" (2/3) ... [2025-02-08 08:51:32,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1260548c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:51:32, skipping insertion in model container [2025-02-08 08:51:32,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:32" (3/3) ... [2025-02-08 08:51:32,173 INFO L128 eAbstractionObserver]: Analyzing ICFG flag_loopdep.i [2025-02-08 08:51:32,184 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:51:32,185 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG flag_loopdep.i that has 1 procedures, 27 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-02-08 08:51:32,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:51:32,242 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;@223d9d0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:51:32,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 08:51:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 20 states have (on average 1.65) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:32,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 08:51:32,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:32,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 08:51:32,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 08:51:32,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:32,256 INFO L85 PathProgramCache]: Analyzing trace with hash 62527, now seen corresponding path program 1 times [2025-02-08 08:51:32,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:32,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592712011] [2025-02-08 08:51:32,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:32,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:32,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:51:32,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:51:32,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:32,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:32,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:32,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592712011] [2025-02-08 08:51:32,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592712011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:32,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:32,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:51:32,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305814731] [2025-02-08 08:51:32,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:32,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:32,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:32,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:32,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:32,475 INFO L87 Difference]: Start difference. First operand has 27 states, 20 states have (on average 1.65) internal successors, (33), 26 states have internal predecessors, (33), 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) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:32,511 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-02-08 08:51:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:32,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-02-08 08:51:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:32,517 INFO L225 Difference]: With dead ends: 40 [2025-02-08 08:51:32,518 INFO L226 Difference]: Without dead ends: 21 [2025-02-08 08:51:32,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-02-08 08:51:32,525 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:32,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:32,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-08 08:51:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-08 08:51:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-02-08 08:51:32,546 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 3 [2025-02-08 08:51:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:32,547 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-02-08 08:51:32,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-02-08 08:51:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 08:51:32,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:32,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 08:51:32,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:51:32,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 08:51:32,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1938335, now seen corresponding path program 1 times [2025-02-08 08:51:32,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:32,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772007673] [2025-02-08 08:51:32,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:32,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:32,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:51:32,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:51:32,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:32,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:32,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:32,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772007673] [2025-02-08 08:51:32,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772007673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:32,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:32,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:51:32,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232711639] [2025-02-08 08:51:32,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:32,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:32,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:32,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:32,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:32,623 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:32,639 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-02-08 08:51:32,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:32,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-08 08:51:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:32,640 INFO L225 Difference]: With dead ends: 25 [2025-02-08 08:51:32,640 INFO L226 Difference]: Without dead ends: 24 [2025-02-08 08:51:32,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-02-08 08:51:32,641 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:32,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:32,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-08 08:51:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-08 08:51:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-02-08 08:51:32,645 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 4 [2025-02-08 08:51:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:32,645 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-02-08 08:51:32,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-02-08 08:51:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 08:51:32,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:32,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:51:32,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:51:32,646 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-02-08 08:51:32,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:32,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1857999096, now seen corresponding path program 1 times [2025-02-08 08:51:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:32,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220975224] [2025-02-08 08:51:32,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:32,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:32,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:51:32,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:51:32,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:32,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:32,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:32,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220975224] [2025-02-08 08:51:32,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220975224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:32,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:32,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:51:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528559076] [2025-02-08 08:51:32,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:32,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:51:32,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:32,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:51:32,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:32,749 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:32,765 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-02-08 08:51:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:51:32,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-02-08 08:51:32,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:32,765 INFO L225 Difference]: With dead ends: 40 [2025-02-08 08:51:32,765 INFO L226 Difference]: Without dead ends: 24 [2025-02-08 08:51:32,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-08 08:51:32,766 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:32,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-08 08:51:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-08 08:51:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-02-08 08:51:32,770 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 6 [2025-02-08 08:51:32,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:32,770 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-08 08:51:32,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-02-08 08:51:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:51:32,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:32,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 08:51:32,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:51:32,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 08:51:32,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1910365057, now seen corresponding path program 1 times [2025-02-08 08:51:32,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:32,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531730735] [2025-02-08 08:51:32,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:32,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:51:32,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:51:32,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:32,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:32,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:32,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531730735] [2025-02-08 08:51:32,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531730735] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:32,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915205750] [2025-02-08 08:51:32,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:32,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:32,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:32,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:32,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:51:32,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:51:32,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:51:32,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:32,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:32,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:51:32,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:32,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:32,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915205750] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:32,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:32,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-08 08:51:32,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639475927] [2025-02-08 08:51:32,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:32,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:51:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:33,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:51:33,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:51:33,001 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:33,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:33,052 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2025-02-08 08:51:33,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:51:33,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 7 [2025-02-08 08:51:33,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:33,053 INFO L225 Difference]: With dead ends: 34 [2025-02-08 08:51:33,053 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 08:51:33,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:51:33,054 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:33,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:33,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 08:51:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-08 08:51:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-02-08 08:51:33,062 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 7 [2025-02-08 08:51:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:33,063 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-02-08 08:51:33,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-02-08 08:51:33,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 08:51:33,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:33,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:33,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:51:33,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:33,264 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-02-08 08:51:33,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:33,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1905043546, now seen corresponding path program 1 times [2025-02-08 08:51:33,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:33,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564659695] [2025-02-08 08:51:33,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:33,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:33,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:51:33,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:51:33,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:33,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:51:33,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:33,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564659695] [2025-02-08 08:51:33,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564659695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:33,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:33,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:51:33,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494210920] [2025-02-08 08:51:33,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:33,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:33,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:33,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:33,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:33,314 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:33,348 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2025-02-08 08:51:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:33,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-02-08 08:51:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:33,349 INFO L225 Difference]: With dead ends: 54 [2025-02-08 08:51:33,349 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 08:51:33,349 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-02-08 08:51:33,349 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:33,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 47 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 08:51:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2025-02-08 08:51:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-02-08 08:51:33,356 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 9 [2025-02-08 08:51:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:33,356 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-02-08 08:51:33,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:33,356 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-02-08 08:51:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 08:51:33,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:33,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:33,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:51:33,357 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-02-08 08:51:33,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:33,358 INFO L85 PathProgramCache]: Analyzing trace with hash -317483913, now seen corresponding path program 1 times [2025-02-08 08:51:33,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:33,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438087861] [2025-02-08 08:51:33,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:33,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:33,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:51:33,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:51:33,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:33,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:51:33,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:33,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438087861] [2025-02-08 08:51:33,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438087861] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:33,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598003276] [2025-02-08 08:51:33,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:33,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:33,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:33,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:33,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:51:33,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:51:33,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:51:33,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:33,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:33,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:51:33,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:51:33,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:51:33,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598003276] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:33,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:33,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-08 08:51:33,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757146965] [2025-02-08 08:51:33,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:33,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:51:33,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:33,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:51:33,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:51:33,592 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:33,617 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-02-08 08:51:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:51:33,618 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 14 [2025-02-08 08:51:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:33,618 INFO L225 Difference]: With dead ends: 59 [2025-02-08 08:51:33,618 INFO L226 Difference]: Without dead ends: 38 [2025-02-08 08:51:33,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:51:33,619 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:33,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:33,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-08 08:51:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-08 08:51:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-02-08 08:51:33,627 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 14 [2025-02-08 08:51:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:33,627 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-02-08 08:51:33,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-02-08 08:51:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 08:51:33,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:33,627 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1] [2025-02-08 08:51:33,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:51:33,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:33,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 08:51:33,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash 95403295, now seen corresponding path program 2 times [2025-02-08 08:51:33,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:33,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487875181] [2025-02-08 08:51:33,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:33,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:33,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 08:51:33,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 08:51:33,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:33,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:51:33,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:33,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487875181] [2025-02-08 08:51:33,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487875181] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:33,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258058880] [2025-02-08 08:51:33,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:33,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:33,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:33,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:33,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:51:33,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 08:51:33,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 08:51:33,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:33,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:33,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:51:33,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:51:34,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:51:34,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258058880] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:34,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:34,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-02-08 08:51:34,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551181854] [2025-02-08 08:51:34,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:34,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:51:34,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:34,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:51:34,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:51:34,036 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:34,052 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-02-08 08:51:34,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:34,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 16 [2025-02-08 08:51:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:34,053 INFO L225 Difference]: With dead ends: 38 [2025-02-08 08:51:34,053 INFO L226 Difference]: Without dead ends: 37 [2025-02-08 08:51:34,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:51:34,054 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:34,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-08 08:51:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-02-08 08:51:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-02-08 08:51:34,057 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 16 [2025-02-08 08:51:34,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:34,057 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-02-08 08:51:34,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:34,058 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-02-08 08:51:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 08:51:34,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:34,058 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 08:51:34,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:51:34,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:34,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 08:51:34,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:34,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1564737847, now seen corresponding path program 2 times [2025-02-08 08:51:34,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:34,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079619323] [2025-02-08 08:51:34,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:34,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:34,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-08 08:51:34,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:51:34,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:51:34,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 08:51:34,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:34,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079619323] [2025-02-08 08:51:34,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079619323] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:34,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352348505] [2025-02-08 08:51:34,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:34,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:34,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:34,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:34,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:51:34,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-08 08:51:34,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:51:34,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:51:34,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:34,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:51:34,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:51:34,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:51:34,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352348505] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:34,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:34,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 20 [2025-02-08 08:51:34,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613729240] [2025-02-08 08:51:34,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:34,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 08:51:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:34,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 08:51:34,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-02-08 08:51:34,653 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:34,754 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2025-02-08 08:51:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 08:51:34,755 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 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 20 [2025-02-08 08:51:34,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:34,755 INFO L225 Difference]: With dead ends: 69 [2025-02-08 08:51:34,755 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 08:51:34,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-02-08 08:51:34,756 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:34,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 97 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:34,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 08:51:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2025-02-08 08:51:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-02-08 08:51:34,764 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2025-02-08 08:51:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:34,764 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-02-08 08:51:34,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-02-08 08:51:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 08:51:34,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:34,764 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:34,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:51:34,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 08:51:34,966 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 08:51:34,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:34,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2120342122, now seen corresponding path program 1 times [2025-02-08 08:51:34,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:34,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028414830] [2025-02-08 08:51:34,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:34,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:34,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:51:35,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:51:35,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:35,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-08 08:51:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028414830] [2025-02-08 08:51:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028414830] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772095473] [2025-02-08 08:51:35,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:35,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:35,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:35,090 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:35,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:51:35,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:51:35,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:51:35,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:35,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:35,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 08:51:35,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:51:35,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:51:35,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772095473] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:35,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:35,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16, 16] total 35 [2025-02-08 08:51:35,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519516348] [2025-02-08 08:51:35,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:35,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 08:51:35,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:35,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 08:51:35,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 08:51:35,780 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:35,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:35,926 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2025-02-08 08:51:35,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-08 08:51:35,926 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 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 33 [2025-02-08 08:51:35,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:35,927 INFO L225 Difference]: With dead ends: 95 [2025-02-08 08:51:35,927 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 08:51:35,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 08:51:35,928 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:35,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 119 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:35,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 08:51:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2025-02-08 08:51:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 65 states have (on average 1.123076923076923) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2025-02-08 08:51:35,933 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 33 [2025-02-08 08:51:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:35,933 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2025-02-08 08:51:35,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2025-02-08 08:51:35,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 08:51:35,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:35,934 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 08:51:35,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:51:36,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:36,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 08:51:36,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:36,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1247607070, now seen corresponding path program 1 times [2025-02-08 08:51:36,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:36,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349790347] [2025-02-08 08:51:36,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:36,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:36,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 08:51:36,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 08:51:36,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:36,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-02-08 08:51:36,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:36,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349790347] [2025-02-08 08:51:36,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349790347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:36,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:36,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:51:36,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723989532] [2025-02-08 08:51:36,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:36,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:36,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:36,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:36,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:36,268 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:36,283 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2025-02-08 08:51:36,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:36,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 57 [2025-02-08 08:51:36,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:36,284 INFO L225 Difference]: With dead ends: 69 [2025-02-08 08:51:36,284 INFO L226 Difference]: Without dead ends: 68 [2025-02-08 08:51:36,284 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-02-08 08:51:36,284 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:36,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-08 08:51:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2025-02-08 08:51:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2025-02-08 08:51:36,290 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 57 [2025-02-08 08:51:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:36,290 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2025-02-08 08:51:36,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2025-02-08 08:51:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 08:51:36,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:36,291 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:36,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:51:36,291 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 08:51:36,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:36,292 INFO L85 PathProgramCache]: Analyzing trace with hash -396832909, now seen corresponding path program 2 times [2025-02-08 08:51:36,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:36,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758000255] [2025-02-08 08:51:36,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:36,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:36,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-08 08:51:36,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 62 statements. [2025-02-08 08:51:36,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:36,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2025-02-08 08:51:36,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:36,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758000255] [2025-02-08 08:51:36,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758000255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:36,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:36,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:51:36,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270878035] [2025-02-08 08:51:36,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:36,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:36,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:36,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:36,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:36,329 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:36,354 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2025-02-08 08:51:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:36,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 62 [2025-02-08 08:51:36,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:36,355 INFO L225 Difference]: With dead ends: 76 [2025-02-08 08:51:36,355 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 08:51:36,356 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-02-08 08:51:36,356 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:36,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 38 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 08:51:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 08:51:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-02-08 08:51:36,361 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 62 [2025-02-08 08:51:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:36,361 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-02-08 08:51:36,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-02-08 08:51:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 08:51:36,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:36,362 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:36,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:51:36,362 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 08:51:36,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:36,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1936106192, now seen corresponding path program 1 times [2025-02-08 08:51:36,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:36,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929048248] [2025-02-08 08:51:36,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:36,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:36,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 08:51:36,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 08:51:36,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:36,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 08:51:37,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:37,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929048248] [2025-02-08 08:51:37,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929048248] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:37,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6473589] [2025-02-08 08:51:37,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:37,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:37,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:37,350 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:37,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:51:37,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 08:51:37,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 08:51:37,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:37,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:37,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 08:51:37,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 08:51:38,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 08:51:39,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6473589] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:39,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:39,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 94 [2025-02-08 08:51:39,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393888182] [2025-02-08 08:51:39,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:39,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2025-02-08 08:51:39,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:39,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2025-02-08 08:51:39,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=6850, Unknown=0, NotChecked=0, Total=8930 [2025-02-08 08:51:39,997 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:40,141 INFO L93 Difference]: Finished difference Result 149 states and 176 transitions. [2025-02-08 08:51:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-02-08 08:51:40,142 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 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 67 [2025-02-08 08:51:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:40,143 INFO L225 Difference]: With dead ends: 149 [2025-02-08 08:51:40,143 INFO L226 Difference]: Without dead ends: 122 [2025-02-08 08:51:40,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2080, Invalid=6850, Unknown=0, NotChecked=0, Total=8930 [2025-02-08 08:51:40,147 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:40,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-08 08:51:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-02-08 08:51:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.0666666666666667) internal successors, (128), 121 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:40,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2025-02-08 08:51:40,158 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 67 [2025-02-08 08:51:40,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:40,159 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2025-02-08 08:51:40,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2025-02-08 08:51:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-08 08:51:40,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:40,162 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:40,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:51:40,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 08:51:40,363 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 08:51:40,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash -525240528, now seen corresponding path program 2 times [2025-02-08 08:51:40,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:40,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044936715] [2025-02-08 08:51:40,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:40,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:40,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-02-08 08:51:40,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 08:51:40,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:51:40,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2025-02-08 08:51:40,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044936715] [2025-02-08 08:51:40,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044936715] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870235587] [2025-02-08 08:51:40,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:40,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:40,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:40,645 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:40,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:51:40,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-02-08 08:51:40,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 08:51:40,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:51:40,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:40,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-08 08:51:40,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 08:51:42,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 08:51:45,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870235587] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:45,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:45,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 64, 64] total 132 [2025-02-08 08:51:45,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126560543] [2025-02-08 08:51:45,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:45,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-02-08 08:51:45,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:45,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-02-08 08:51:45,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4168, Invalid=13124, Unknown=0, NotChecked=0, Total=17292 [2025-02-08 08:51:45,655 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand has 132 states, 132 states have (on average 1.6818181818181819) internal successors, (222), 132 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:45,992 INFO L93 Difference]: Finished difference Result 244 states and 288 transitions. [2025-02-08 08:51:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-02-08 08:51:45,992 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.6818181818181819) internal successors, (222), 132 states have internal predecessors, (222), 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 115 [2025-02-08 08:51:45,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:45,993 INFO L225 Difference]: With dead ends: 244 [2025-02-08 08:51:45,993 INFO L226 Difference]: Without dead ends: 217 [2025-02-08 08:51:45,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4773 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4168, Invalid=13124, Unknown=0, NotChecked=0, Total=17292 [2025-02-08 08:51:45,997 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:45,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 137 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:51:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-08 08:51:46,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-02-08 08:51:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.0324074074074074) internal successors, (223), 216 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 223 transitions. [2025-02-08 08:51:46,008 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 223 transitions. Word has length 115 [2025-02-08 08:51:46,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:46,008 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 223 transitions. [2025-02-08 08:51:46,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.6818181818181819) internal successors, (222), 132 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 223 transitions. [2025-02-08 08:51:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-08 08:51:46,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:46,010 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 08:51:46,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:51:46,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:46,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 08:51:46,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:46,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1273477814, now seen corresponding path program 1 times [2025-02-08 08:51:46,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:46,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516478184] [2025-02-08 08:51:46,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:46,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:46,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 08:51:46,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 08:51:46,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:46,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5934 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2025-02-08 08:51:46,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:46,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516478184] [2025-02-08 08:51:46,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516478184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:46,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:46,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:51:46,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031110834] [2025-02-08 08:51:46,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:46,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:46,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:46,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:46,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:46,499 INFO L87 Difference]: Start difference. First operand 217 states and 223 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:46,517 INFO L93 Difference]: Finished difference Result 217 states and 223 transitions. [2025-02-08 08:51:46,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:46,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 212 [2025-02-08 08:51:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:46,518 INFO L225 Difference]: With dead ends: 217 [2025-02-08 08:51:46,519 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:51:46,519 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-02-08 08:51:46,520 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:46,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:51:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:51:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:51:46,522 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2025-02-08 08:51:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:46,522 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:51:46,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:51:46,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:51:46,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-08 08:51:46,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-08 08:51:46,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-08 08:51:46,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-08 08:51:46,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-08 08:51:46,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-08 08:51:46,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:51:46,530 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:46,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:51:47,098 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:51:47,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:51:47 BoogieIcfgContainer [2025-02-08 08:51:47,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:51:47,109 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:51:47,109 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:51:47,109 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:51:47,110 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:32" (3/4) ... [2025-02-08 08:51:47,111 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:51:47,117 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-08 08:51:47,117 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 08:51:47,117 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 08:51:47,117 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:51:47,177 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:51:47,177 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:51:47,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:51:47,179 INFO L158 Benchmark]: Toolchain (without parser) took 15498.40ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 154.7MB in the beginning and 125.6MB in the end (delta: 29.1MB). Peak memory consumption was 126.0MB. Max. memory is 16.1GB. [2025-02-08 08:51:47,179 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:51:47,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 137.99ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 143.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:51:47,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.14ms. Allocated memory is still 201.3MB. Free memory was 143.4MB in the beginning and 142.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:51:47,179 INFO L158 Benchmark]: Boogie Preprocessor took 27.84ms. Allocated memory is still 201.3MB. Free memory was 142.1MB in the beginning and 140.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:51:47,180 INFO L158 Benchmark]: IcfgBuilder took 283.63ms. Allocated memory is still 201.3MB. Free memory was 140.8MB in the beginning and 127.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:51:47,180 INFO L158 Benchmark]: TraceAbstraction took 14944.55ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 126.9MB in the beginning and 133.7MB in the end (delta: -6.8MB). Peak memory consumption was 138.5MB. Max. memory is 16.1GB. [2025-02-08 08:51:47,180 INFO L158 Benchmark]: Witness Printer took 68.07ms. Allocated memory is still 302.0MB. Free memory was 133.7MB in the beginning and 125.6MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:51:47,183 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 137.99ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 143.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.14ms. Allocated memory is still 201.3MB. Free memory was 143.4MB in the beginning and 142.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.84ms. Allocated memory is still 201.3MB. Free memory was 142.1MB in the beginning and 140.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 283.63ms. Allocated memory is still 201.3MB. Free memory was 140.8MB in the beginning and 127.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14944.55ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 126.9MB in the beginning and 133.7MB in the end (delta: -6.8MB). Peak memory consumption was 138.5MB. Max. memory is 16.1GB. * Witness Printer took 68.07ms. Allocated memory is still 302.0MB. Free memory was 133.7MB in the beginning and 125.6MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 14, TraceHistogramMax: 63, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 1092 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 841 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1040 IncrementalHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 251 mSDtfsCounter, 1040 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 606 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7576 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=13, InterpolantAutomatonStates: 295, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 897 NumberOfCodeBlocks, 818 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1141 ConstructedInterpolants, 0 QuantifiedInterpolants, 3413 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2226 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 28 InterpolantComputations, 7 PerfectInterpolantSequences, 8265/12316 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((size <= 1000000) && (0 <= i)) - InvariantResult [Line: 42]: Location Invariant Derived location invariant: ((i == 0) || (0 < i)) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: ((i == 0) || (0 < i)) RESULT: Ultimate proved your program to be correct! [2025-02-08 08:51:47,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE