./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/mlceu2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/mlceu2.c -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 5f6dc88ffbc484195ca6ca04cd67e8542305d5e0e0d9b35d5440f9c4d427d3ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:19:50,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:19:50,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:19:50,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:19:50,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:19:50,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:19:50,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:19:50,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:19:50,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:19:50,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:19:50,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:19:50,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:19:50,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:19:50,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:19:50,857 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:19:50,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:19:50,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:19:50,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:19:50,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:19:50,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:19:50,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:19:50,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:19:50,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:19:50,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:19:50,858 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:19:50,858 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:19:50,858 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:19:50,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:19:50,858 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:19:50,858 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:19:50,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:19:50,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:19:50,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:19:50,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:19:50,859 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 -> 5f6dc88ffbc484195ca6ca04cd67e8542305d5e0e0d9b35d5440f9c4d427d3ec [2025-01-10 01:19:51,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:19:51,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:19:51,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:19:51,092 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:19:51,093 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:19:51,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mlceu2.c [2025-01-10 01:19:52,312 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0c9f1951/3545e0dcf1254638a0d3a9eda79155fc/FLAG053bb5f9b [2025-01-10 01:19:52,582 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:19:52,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/mlceu2.c [2025-01-10 01:19:52,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0c9f1951/3545e0dcf1254638a0d3a9eda79155fc/FLAG053bb5f9b [2025-01-10 01:19:52,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0c9f1951/3545e0dcf1254638a0d3a9eda79155fc [2025-01-10 01:19:52,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:19:52,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:19:52,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:19:52,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:19:52,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:19:52,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:19:52" (1/1) ... [2025-01-10 01:19:52,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71f8fa60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:52, skipping insertion in model container [2025-01-10 01:19:52,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:19:52" (1/1) ... [2025-01-10 01:19:52,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:19:53,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:19:53,037 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:19:53,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:19:53,064 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:19:53,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53 WrapperNode [2025-01-10 01:19:53,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:19:53,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:19:53,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:19:53,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:19:53,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (1/1) ... [2025-01-10 01:19:53,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (1/1) ... [2025-01-10 01:19:53,089 INFO L138 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 49 [2025-01-10 01:19:53,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:19:53,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:19:53,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:19:53,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:19:53,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (1/1) ... [2025-01-10 01:19:53,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (1/1) ... [2025-01-10 01:19:53,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (1/1) ... [2025-01-10 01:19:53,111 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 2 writes are split as follows [0, 2]. [2025-01-10 01:19:53,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (1/1) ... [2025-01-10 01:19:53,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (1/1) ... [2025-01-10 01:19:53,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (1/1) ... [2025-01-10 01:19:53,118 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (1/1) ... [2025-01-10 01:19:53,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (1/1) ... [2025-01-10 01:19:53,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (1/1) ... [2025-01-10 01:19:53,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (1/1) ... [2025-01-10 01:19:53,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:19:53,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:19:53,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:19:53,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:19:53,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (1/1) ... [2025-01-10 01:19:53,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:19:53,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:19:53,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:19:53,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:19:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:19:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:19:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:19:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:19:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:19:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:19:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:19:53,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:19:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:19:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:19:53,218 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:19:53,220 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:19:53,325 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-10 01:19:53,326 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:19:53,332 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:19:53,332 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:19:53,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:19:53 BoogieIcfgContainer [2025-01-10 01:19:53,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:19:53,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:19:53,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:19:53,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:19:53,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:19:52" (1/3) ... [2025-01-10 01:19:53,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5068b4d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:19:53, skipping insertion in model container [2025-01-10 01:19:53,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:53" (2/3) ... [2025-01-10 01:19:53,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5068b4d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:19:53, skipping insertion in model container [2025-01-10 01:19:53,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:19:53" (3/3) ... [2025-01-10 01:19:53,340 INFO L128 eAbstractionObserver]: Analyzing ICFG mlceu2.c [2025-01-10 01:19:53,350 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:19:53,352 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mlceu2.c that has 1 procedures, 23 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-10 01:19:53,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:19:53,398 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;@44b6eb4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:19:53,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:19:53,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:19:53,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:19:53,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:19:53,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:19:53,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:19:53,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966406, now seen corresponding path program 1 times [2025-01-10 01:19:53,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:19:53,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096108240] [2025-01-10 01:19:53,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:19:53,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:19:53,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:19:53,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:19:53,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:19:53,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:19:53,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:19:53,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096108240] [2025-01-10 01:19:53,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096108240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:19:53,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:19:53,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:19:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133002807] [2025-01-10 01:19:53,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:19:53,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:19:53,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:19:53,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:19:53,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:19:53,607 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 22 states have internal predecessors, (27), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:53,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:19:53,655 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2025-01-10 01:19:53,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:19:53,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 01:19:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:19:53,661 INFO L225 Difference]: With dead ends: 49 [2025-01-10 01:19:53,661 INFO L226 Difference]: Without dead ends: 23 [2025-01-10 01:19:53,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:19:53,669 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:19:53,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 30 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:19:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-10 01:19:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2025-01-10 01:19:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-01-10 01:19:53,690 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2025-01-10 01:19:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:19:53,690 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-01-10 01:19:53,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2025-01-10 01:19:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:19:53,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:19:53,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:19:53,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:19:53,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:19:53,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:19:53,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1804968328, now seen corresponding path program 1 times [2025-01-10 01:19:53,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:19:53,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001455185] [2025-01-10 01:19:53,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:19:53,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:19:53,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:19:53,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:19:53,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:19:53,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:19:53,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:19:53,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001455185] [2025-01-10 01:19:53,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001455185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:19:53,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:19:53,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:19:53,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771255098] [2025-01-10 01:19:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:19:53,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:19:53,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:19:53,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:19:53,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:19:53,765 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:19:53,795 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-01-10 01:19:53,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:19:53,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-01-10 01:19:53,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:19:53,796 INFO L225 Difference]: With dead ends: 27 [2025-01-10 01:19:53,796 INFO L226 Difference]: Without dead ends: 25 [2025-01-10 01:19:53,797 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-01-10 01:19:53,797 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:19:53,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:19:53,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-10 01:19:53,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2025-01-10 01:19:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 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-01-10 01:19:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-01-10 01:19:53,800 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2025-01-10 01:19:53,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:19:53,800 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-01-10 01:19:53,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-01-10 01:19:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:19:53,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:19:53,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:19:53,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:19:53,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:19:53,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:19:53,801 INFO L85 PathProgramCache]: Analyzing trace with hash 131825502, now seen corresponding path program 1 times [2025-01-10 01:19:53,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:19:53,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951352160] [2025-01-10 01:19:53,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:19:53,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:19:53,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:19:53,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:19:53,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:19:53,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:19:53,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:19:53,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951352160] [2025-01-10 01:19:53,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951352160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:19:53,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:19:53,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:19:53,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517386442] [2025-01-10 01:19:53,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:19:53,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:19:53,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:19:53,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:19:53,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:19:53,852 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:19:53,870 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-01-10 01:19:53,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:19:53,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-01-10 01:19:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:19:53,871 INFO L225 Difference]: With dead ends: 29 [2025-01-10 01:19:53,871 INFO L226 Difference]: Without dead ends: 22 [2025-01-10 01:19:53,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:19:53,871 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 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-01-10 01:19:53,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:19:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-10 01:19:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-10 01:19:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-01-10 01:19:53,874 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 8 [2025-01-10 01:19:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:19:53,874 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-01-10 01:19:53,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-01-10 01:19:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:19:53,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:19:53,875 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:19:53,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:19:53,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:19:53,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:19:53,876 INFO L85 PathProgramCache]: Analyzing trace with hash 816646287, now seen corresponding path program 1 times [2025-01-10 01:19:53,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:19:53,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613063781] [2025-01-10 01:19:53,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:19:53,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:19:53,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:19:53,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:19:53,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:19:53,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:19:53,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:19:53,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613063781] [2025-01-10 01:19:53,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613063781] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:19:53,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900039190] [2025-01-10 01:19:53,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:19:53,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:19:53,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:19:53,950 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-01-10 01:19:53,952 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-01-10 01:19:53,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:19:54,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:19:54,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:19:54,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:54,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:19:54,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:19:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:19:54,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:19:54,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900039190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:19:54,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:19:54,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 01:19:54,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371553315] [2025-01-10 01:19:54,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:19:54,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:19:54,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:19:54,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:19:54,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:19:54,088 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:19:54,137 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-01-10 01:19:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:19:54,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2025-01-10 01:19:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:19:54,138 INFO L225 Difference]: With dead ends: 25 [2025-01-10 01:19:54,138 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 01:19:54,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:19:54,139 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:19:54,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 25 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:19:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 01:19:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2025-01-10 01:19:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-01-10 01:19:54,142 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2025-01-10 01:19:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:19:54,142 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-01-10 01:19:54,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2025-01-10 01:19:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:19:54,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:19:54,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:19:54,154 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-01-10 01:19:54,343 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-01-10 01:19:54,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:19:54,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:19:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash -441327115, now seen corresponding path program 1 times [2025-01-10 01:19:54,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:19:54,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870581535] [2025-01-10 01:19:54,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:19:54,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:19:54,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:19:54,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:19:54,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:19:54,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:19:54,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:19:54,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870581535] [2025-01-10 01:19:54,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870581535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:19:54,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:19:54,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:19:54,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732146413] [2025-01-10 01:19:54,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:19:54,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:19:54,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:19:54,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:19:54,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:19:54,439 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:19:54,479 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-01-10 01:19:54,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:19:54,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-01-10 01:19:54,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:19:54,480 INFO L225 Difference]: With dead ends: 28 [2025-01-10 01:19:54,480 INFO L226 Difference]: Without dead ends: 26 [2025-01-10 01:19:54,481 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-01-10 01:19:54,481 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:19:54,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 25 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:19:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-10 01:19:54,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-10 01:19:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 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-01-10 01:19:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-01-10 01:19:54,484 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2025-01-10 01:19:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:19:54,485 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-01-10 01:19:54,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:54,485 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-01-10 01:19:54,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:19:54,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:19:54,486 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:19:54,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:19:54,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:19:54,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:19:54,486 INFO L85 PathProgramCache]: Analyzing trace with hash -453768829, now seen corresponding path program 1 times [2025-01-10 01:19:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:19:54,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494817823] [2025-01-10 01:19:54,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:19:54,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:19:54,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:19:54,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:19:54,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:19:54,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:19:54,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:19:54,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494817823] [2025-01-10 01:19:54,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494817823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:19:54,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400581445] [2025-01-10 01:19:54,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:19:54,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:19:54,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:19:54,572 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-01-10 01:19:54,573 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-01-10 01:19:54,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:19:54,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:19:54,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:19:54,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:54,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:19:54,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:19:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:19:54,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:19:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:19:54,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400581445] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:19:54,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:19:54,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:19:54,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069005628] [2025-01-10 01:19:54,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:19:54,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:19:54,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:19:54,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:19:54,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:19:54,767 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:19:54,831 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2025-01-10 01:19:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:19:54,832 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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 13 [2025-01-10 01:19:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:19:54,833 INFO L225 Difference]: With dead ends: 59 [2025-01-10 01:19:54,833 INFO L226 Difference]: Without dead ends: 41 [2025-01-10 01:19:54,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:19:54,834 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:19:54,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 28 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:19:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-10 01:19:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-10 01:19:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 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-01-10 01:19:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-01-10 01:19:54,843 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 13 [2025-01-10 01:19:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:19:54,843 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-01-10 01:19:54,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2025-01-10 01:19:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:19:54,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:19:54,843 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:19:54,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:19:55,044 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-01-10 01:19:55,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:19:55,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:19:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1721170659, now seen corresponding path program 1 times [2025-01-10 01:19:55,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:19:55,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322358207] [2025-01-10 01:19:55,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:19:55,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:19:55,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:19:55,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:19:55,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:19:55,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:19:55,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:19:55,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322358207] [2025-01-10 01:19:55,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322358207] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:19:55,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331763424] [2025-01-10 01:19:55,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:19:55,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:19:55,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:19:55,155 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-01-10 01:19:55,156 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-01-10 01:19:55,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:19:55,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:19:55,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:19:55,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:55,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:19:55,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:19:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:19:55,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:19:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:19:55,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331763424] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:19:55,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:19:55,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:19:55,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917358585] [2025-01-10 01:19:55,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:19:55,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:19:55,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:19:55,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:19:55,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:19:55,304 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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-01-10 01:19:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:19:55,361 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-01-10 01:19:55,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:19:55,361 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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) Word has length 18 [2025-01-10 01:19:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:19:55,362 INFO L225 Difference]: With dead ends: 53 [2025-01-10 01:19:55,362 INFO L226 Difference]: Without dead ends: 41 [2025-01-10 01:19:55,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:19:55,362 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:19:55,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 35 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:19:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-10 01:19:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-10 01:19:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.236842105263158) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-01-10 01:19:55,367 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 18 [2025-01-10 01:19:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:19:55,367 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-01-10 01:19:55,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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-01-10 01:19:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-01-10 01:19:55,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:19:55,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:19:55,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:19:55,374 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-01-10 01:19:55,568 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-01-10 01:19:55,568 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:19:55,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:19:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash 51533556, now seen corresponding path program 2 times [2025-01-10 01:19:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:19:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395756810] [2025-01-10 01:19:55,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:19:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:19:55,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:19:55,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:19:55,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:19:55,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:19:55,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:19:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395756810] [2025-01-10 01:19:55,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395756810] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:19:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533202810] [2025-01-10 01:19:55,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:19:55,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:19:55,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:19:55,660 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-01-10 01:19:55,664 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-01-10 01:19:55,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:19:55,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:19:55,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:19:55,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:55,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:19:55,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:19:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:19:55,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:19:55,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533202810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:19:55,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:19:55,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 01:19:55,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053872877] [2025-01-10 01:19:55,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:19:55,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:19:55,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:19:55,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:19:55,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:19:55,739 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:19:55,771 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-01-10 01:19:55,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:19:55,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 23 [2025-01-10 01:19:55,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:19:55,772 INFO L225 Difference]: With dead ends: 42 [2025-01-10 01:19:55,772 INFO L226 Difference]: Without dead ends: 41 [2025-01-10 01:19:55,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:19:55,773 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:19:55,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:19:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-10 01:19:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-01-10 01:19:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 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-01-10 01:19:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-01-10 01:19:55,776 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 23 [2025-01-10 01:19:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:19:55,776 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-01-10 01:19:55,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-01-10 01:19:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 01:19:55,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:19:55,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:19:55,783 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-01-10 01:19:55,980 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-01-10 01:19:55,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:19:55,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:19:55,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1597540307, now seen corresponding path program 1 times [2025-01-10 01:19:55,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:19:55,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598390182] [2025-01-10 01:19:55,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:19:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:19:55,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:19:55,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:19:55,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:19:55,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:19:56,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:19:56,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598390182] [2025-01-10 01:19:56,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598390182] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:19:56,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835049983] [2025-01-10 01:19:56,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:19:56,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:19:56,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:19:56,055 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-01-10 01:19:56,056 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-01-10 01:19:56,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:19:56,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:19:56,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:19:56,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:56,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:19:56,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:19:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:19:56,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:19:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:19:56,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835049983] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:19:56,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:19:56,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:19:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233660936] [2025-01-10 01:19:56,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:19:56,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:19:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:19:56,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:19:56,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:19:56,168 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:56,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:19:56,240 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-01-10 01:19:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:19:56,241 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 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 24 [2025-01-10 01:19:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:19:56,243 INFO L225 Difference]: With dead ends: 57 [2025-01-10 01:19:56,243 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 01:19:56,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:19:56,244 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:19:56,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:19:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 01:19:56,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2025-01-10 01:19:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.150943396226415) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2025-01-10 01:19:56,254 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 24 [2025-01-10 01:19:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:19:56,254 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2025-01-10 01:19:56,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2025-01-10 01:19:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:19:56,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:19:56,255 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 1, 1, 1, 1] [2025-01-10 01:19:56,264 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-01-10 01:19:56,456 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-01-10 01:19:56,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:19:56,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:19:56,457 INFO L85 PathProgramCache]: Analyzing trace with hash -700528020, now seen corresponding path program 2 times [2025-01-10 01:19:56,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:19:56,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615154506] [2025-01-10 01:19:56,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:19:56,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:19:56,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:19:56,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 28 statements. [2025-01-10 01:19:56,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:19:56,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-10 01:19:56,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:19:56,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615154506] [2025-01-10 01:19:56,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615154506] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:19:56,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398487921] [2025-01-10 01:19:56,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:19:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:19:56,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:19:56,503 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-01-10 01:19:56,504 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-01-10 01:19:56,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:19:56,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 28 statements. [2025-01-10 01:19:56,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:19:56,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:56,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:19:56,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:19:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-10 01:19:56,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:19:56,615 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-10 01:19:56,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398487921] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:19:56,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:19:56,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 01:19:56,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542115811] [2025-01-10 01:19:56,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:19:56,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:19:56,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:19:56,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:19:56,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:19:56,616 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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-01-10 01:19:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:19:56,657 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2025-01-10 01:19:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:19:56,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Word has length 28 [2025-01-10 01:19:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:19:56,657 INFO L225 Difference]: With dead ends: 86 [2025-01-10 01:19:56,657 INFO L226 Difference]: Without dead ends: 46 [2025-01-10 01:19:56,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:19:56,658 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:19:56,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 17 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:19:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-10 01:19:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2025-01-10 01:19:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2025-01-10 01:19:56,673 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 28 [2025-01-10 01:19:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:19:56,673 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2025-01-10 01:19:56,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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-01-10 01:19:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2025-01-10 01:19:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-10 01:19:56,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:19:56,673 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:19:56,680 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-01-10 01:19:56,874 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,SelfDestructingSolverStorable9 [2025-01-10 01:19:56,874 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:19:56,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:19:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash -256561463, now seen corresponding path program 2 times [2025-01-10 01:19:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:19:56,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221612456] [2025-01-10 01:19:56,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:19:56,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:19:56,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-10 01:19:56,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 39 statements. [2025-01-10 01:19:56,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:19:56,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-10 01:19:56,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:19:56,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221612456] [2025-01-10 01:19:56,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221612456] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:19:56,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096020878] [2025-01-10 01:19:56,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:19:56,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:19:56,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:19:56,944 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-01-10 01:19:56,947 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-01-10 01:19:56,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-10 01:19:56,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 39 statements. [2025-01-10 01:19:56,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:19:56,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:19:56,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:19:56,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:19:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-10 01:19:57,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:19:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-10 01:19:57,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096020878] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:19:57,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:19:57,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 01:19:57,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461791477] [2025-01-10 01:19:57,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:19:57,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:19:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:19:57,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:19:57,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:19:57,120 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:57,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:19:57,178 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2025-01-10 01:19:57,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:19:57,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 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 39 [2025-01-10 01:19:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:19:57,178 INFO L225 Difference]: With dead ends: 40 [2025-01-10 01:19:57,178 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:19:57,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:19:57,179 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:19:57,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 15 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:19:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:19:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:19:57,179 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-01-10 01:19:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:19:57,179 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2025-01-10 01:19:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:19:57,179 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:19:57,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:19:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:19:57,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:19:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 01:19:57,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 01:19:57,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 01:19:57,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 01:19:57,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:19:57,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:19:57,385 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:19:57,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:19:57,449 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:19:57,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:19:57 BoogieIcfgContainer [2025-01-10 01:19:57,457 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:19:57,458 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:19:57,458 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:19:57,458 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:19:57,458 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:19:53" (3/4) ... [2025-01-10 01:19:57,460 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:19:57,465 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-10 01:19:57,465 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:19:57,465 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:19:57,465 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:19:57,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:19:57,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:19:57,518 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:19:57,519 INFO L158 Benchmark]: Toolchain (without parser) took 4615.17ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 73.8MB in the end (delta: 35.5MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2025-01-10 01:19:57,519 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:19:57,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.09ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 98.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:19:57,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.42ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 97.3MB in the end (delta: 875.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:19:57,519 INFO L158 Benchmark]: Boogie Preprocessor took 36.63ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:19:57,519 INFO L158 Benchmark]: RCFGBuilder took 205.54ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 84.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:19:57,519 INFO L158 Benchmark]: TraceAbstraction took 4123.34ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 79.8MB in the end (delta: 4.4MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2025-01-10 01:19:57,519 INFO L158 Benchmark]: Witness Printer took 60.10ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 73.8MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:19:57,520 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.20ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.09ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 98.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.42ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 97.3MB in the end (delta: 875.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.63ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 205.54ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 84.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4123.34ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 79.8MB in the end (delta: 4.4MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Witness Printer took 60.10ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 73.8MB in the end (delta: 6.1MB). There was no memory consumed. 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: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: 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, 23 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 291 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 412 IncrementalHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 114 mSDtfsCounter, 412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 249 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=9, InterpolantAutomatonStates: 63, 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, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 349 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 448 ConstructedInterpolants, 0 QuantifiedInterpolants, 1128 SizeOfPredicates, 4 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 298/418 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 4 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((0 <= (i + 2147483648)) && (i <= 2147483646)) && (SIZE <= 99999)) && (MAX <= 100000)) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((1 <= i) && (i <= 2147483646)) && (SIZE <= 99999)) && (MAX <= 100000)) || ((((i == 0) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:19:57,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE