./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound100.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/nla-digbench-scaling/sqrt1-ll_valuebound100.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 ecbe5f0ce97488539db604edfadf8e9064f15df8e290f20f11bd6c6bd2401ed2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:29:15,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:29:16,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:29:16,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:29:16,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:29:16,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:29:16,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:29:16,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:29:16,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:29:16,056 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:29:16,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:29:16,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:29:16,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:29:16,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:29:16,057 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:29:16,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:29:16,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:29:16,057 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:29:16,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:29:16,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:29:16,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:29:16,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:29:16,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:29:16,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:29:16,058 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:29:16,058 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:29:16,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:29:16,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:29:16,059 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:29:16,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:29:16,059 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:29:16,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:29:16,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:29:16,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:29:16,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:29:16,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:29:16,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:29:16,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:29:16,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:29:16,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:29:16,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:29:16,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:29:16,060 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:29:16,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:29:16,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:29:16,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:29:16,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:29:16,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:29:16,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:29:16,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:29:16,060 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 -> ecbe5f0ce97488539db604edfadf8e9064f15df8e290f20f11bd6c6bd2401ed2 [2025-01-10 02:29:16,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:29:16,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:29:16,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:29:16,308 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:29:16,308 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:29:16,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound100.c [2025-01-10 02:29:17,400 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75e26fec2/ba8b55356baa492caaa0f79a41d25d0f/FLAGf7d575a13 [2025-01-10 02:29:17,581 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:29:17,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound100.c [2025-01-10 02:29:17,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75e26fec2/ba8b55356baa492caaa0f79a41d25d0f/FLAGf7d575a13 [2025-01-10 02:29:17,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75e26fec2/ba8b55356baa492caaa0f79a41d25d0f [2025-01-10 02:29:17,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:29:17,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:29:17,974 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:29:17,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:29:17,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:29:17,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:29:17" (1/1) ... [2025-01-10 02:29:17,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25976e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:17, skipping insertion in model container [2025-01-10 02:29:17,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:29:17" (1/1) ... [2025-01-10 02:29:17,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:29:18,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:29:18,101 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:29:18,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:29:18,129 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:29:18,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18 WrapperNode [2025-01-10 02:29:18,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:29:18,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:29:18,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:29:18,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:29:18,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (1/1) ... [2025-01-10 02:29:18,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (1/1) ... [2025-01-10 02:29:18,154 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2025-01-10 02:29:18,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:29:18,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:29:18,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:29:18,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:29:18,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (1/1) ... [2025-01-10 02:29:18,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (1/1) ... [2025-01-10 02:29:18,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (1/1) ... [2025-01-10 02:29:18,180 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 02:29:18,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (1/1) ... [2025-01-10 02:29:18,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (1/1) ... [2025-01-10 02:29:18,182 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (1/1) ... [2025-01-10 02:29:18,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (1/1) ... [2025-01-10 02:29:18,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (1/1) ... [2025-01-10 02:29:18,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (1/1) ... [2025-01-10 02:29:18,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (1/1) ... [2025-01-10 02:29:18,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:29:18,194 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:29:18,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:29:18,194 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:29:18,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (1/1) ... [2025-01-10 02:29:18,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:29:18,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:18,224 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 02:29:18,227 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 02:29:18,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:29:18,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:29:18,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:29:18,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:29:18,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:29:18,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:29:18,287 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:29:18,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:29:18,510 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-01-10 02:29:18,510 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:29:18,518 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:29:18,518 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:29:18,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:29:18 BoogieIcfgContainer [2025-01-10 02:29:18,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:29:18,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:29:18,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:29:18,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:29:18,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:29:17" (1/3) ... [2025-01-10 02:29:18,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8577acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:29:18, skipping insertion in model container [2025-01-10 02:29:18,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:18" (2/3) ... [2025-01-10 02:29:18,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8577acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:29:18, skipping insertion in model container [2025-01-10 02:29:18,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:29:18" (3/3) ... [2025-01-10 02:29:18,525 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound100.c [2025-01-10 02:29:18,534 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:29:18,535 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt1-ll_valuebound100.c that has 2 procedures, 121 locations, 1 initial locations, 1 loop locations, and 50 error locations. [2025-01-10 02:29:18,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:29:18,588 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;@79bd3984, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:29:18,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-10 02:29:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 113 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:29:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 02:29:18,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:18,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 02:29:18,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:18,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:18,600 INFO L85 PathProgramCache]: Analyzing trace with hash 28693830, now seen corresponding path program 1 times [2025-01-10 02:29:18,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:18,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128966308] [2025-01-10 02:29:18,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:18,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:18,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 02:29:18,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 02:29:18,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:18,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:18,689 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 02:29:18,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:18,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128966308] [2025-01-10 02:29:18,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128966308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:18,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:18,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:29:18,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233951692] [2025-01-10 02:29:18,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:18,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:29:18,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:18,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:29:18,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:29:18,711 INFO L87 Difference]: Start difference. First operand has 121 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 113 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:18,731 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2025-01-10 02:29:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:29:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 02:29:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:18,736 INFO L225 Difference]: With dead ends: 234 [2025-01-10 02:29:18,737 INFO L226 Difference]: Without dead ends: 110 [2025-01-10 02:29:18,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:29:18,743 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:18,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:29:18,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-10 02:29:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-10 02:29:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 58 states have (on average 1.793103448275862) internal successors, (104), 103 states have internal predecessors, (104), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:29:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2025-01-10 02:29:18,774 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 5 [2025-01-10 02:29:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:18,774 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2025-01-10 02:29:18,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2025-01-10 02:29:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 02:29:18,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:18,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 02:29:18,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:29:18,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:18,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:18,776 INFO L85 PathProgramCache]: Analyzing trace with hash 28695752, now seen corresponding path program 1 times [2025-01-10 02:29:18,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:18,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972168549] [2025-01-10 02:29:18,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:18,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:18,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 02:29:18,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 02:29:18,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:18,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:18,831 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 02:29:18,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:18,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972168549] [2025-01-10 02:29:18,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972168549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:18,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:18,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:29:18,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174667753] [2025-01-10 02:29:18,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:18,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:29:18,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:18,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:29:18,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:29:18,835 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:18,942 INFO L93 Difference]: Finished difference Result 204 states and 213 transitions. [2025-01-10 02:29:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:29:18,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 02:29:18,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:18,943 INFO L225 Difference]: With dead ends: 204 [2025-01-10 02:29:18,944 INFO L226 Difference]: Without dead ends: 184 [2025-01-10 02:29:18,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:29:18,945 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 68 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:18,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 162 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:18,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-10 02:29:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 149. [2025-01-10 02:29:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 93 states have (on average 1.6236559139784945) internal successors, (151), 138 states have internal predecessors, (151), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:29:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2025-01-10 02:29:18,957 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 5 [2025-01-10 02:29:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:18,957 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2025-01-10 02:29:18,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2025-01-10 02:29:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 02:29:18,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:18,958 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:18,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:29:18,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:18,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1517972360, now seen corresponding path program 1 times [2025-01-10 02:29:18,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:18,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167385089] [2025-01-10 02:29:18,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:18,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:18,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:29:18,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:29:18,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:18,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:29:18,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103171309] [2025-01-10 02:29:18,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:18,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:18,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:18,986 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 02:29:18,987 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 02:29:19,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:29:19,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:29:19,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:19,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:19,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:29:19,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:29:19,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:29:19,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:19,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167385089] [2025-01-10 02:29:19,072 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:29:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103171309] [2025-01-10 02:29:19,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103171309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:19,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:19,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:29:19,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393160610] [2025-01-10 02:29:19,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:19,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:29:19,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:19,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:29:19,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:29:19,073 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:19,157 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2025-01-10 02:29:19,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:29:19,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-10 02:29:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:19,158 INFO L225 Difference]: With dead ends: 176 [2025-01-10 02:29:19,159 INFO L226 Difference]: Without dead ends: 168 [2025-01-10 02:29:19,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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 02:29:19,159 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 41 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:19,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 148 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-10 02:29:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2025-01-10 02:29:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 103 states have (on average 1.5728155339805825) internal successors, (162), 148 states have internal predecessors, (162), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:29:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 182 transitions. [2025-01-10 02:29:19,175 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 182 transitions. Word has length 26 [2025-01-10 02:29:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:19,175 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 182 transitions. [2025-01-10 02:29:19,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2025-01-10 02:29:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 02:29:19,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:19,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:19,182 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 02:29:19,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:19,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:19,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:19,381 INFO L85 PathProgramCache]: Analyzing trace with hash -187497026, now seen corresponding path program 1 times [2025-01-10 02:29:19,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:19,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403933952] [2025-01-10 02:29:19,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:19,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:19,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 02:29:19,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 02:29:19,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:19,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:29:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:19,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403933952] [2025-01-10 02:29:19,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403933952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:19,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:19,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:29:19,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728217410] [2025-01-10 02:29:19,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:19,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:29:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:19,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:29:19,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:29:19,445 INFO L87 Difference]: Start difference. First operand 160 states and 182 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:19,522 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2025-01-10 02:29:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:29:19,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-01-10 02:29:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:19,524 INFO L225 Difference]: With dead ends: 176 [2025-01-10 02:29:19,524 INFO L226 Difference]: Without dead ends: 166 [2025-01-10 02:29:19,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:29:19,525 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:19,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 162 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-10 02:29:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2025-01-10 02:29:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.490566037735849) internal successors, (158), 151 states have internal predecessors, (158), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:29:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2025-01-10 02:29:19,554 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 27 [2025-01-10 02:29:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:19,554 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2025-01-10 02:29:19,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:19,554 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2025-01-10 02:29:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 02:29:19,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:19,555 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:19,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:29:19,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:19,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2028622092, now seen corresponding path program 1 times [2025-01-10 02:29:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:19,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861292133] [2025-01-10 02:29:19,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:19,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:19,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:29:19,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:29:19,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:19,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:29:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861292133] [2025-01-10 02:29:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861292133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:19,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:29:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377127118] [2025-01-10 02:29:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:19,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:29:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:19,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:29:19,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:19,647 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:19,759 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2025-01-10 02:29:19,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:29:19,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-01-10 02:29:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:19,760 INFO L225 Difference]: With dead ends: 168 [2025-01-10 02:29:19,760 INFO L226 Difference]: Without dead ends: 166 [2025-01-10 02:29:19,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:19,761 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 46 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:19,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 211 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-10 02:29:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2025-01-10 02:29:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.471698113207547) internal successors, (156), 151 states have internal predecessors, (156), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:29:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2025-01-10 02:29:19,770 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 30 [2025-01-10 02:29:19,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:19,770 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2025-01-10 02:29:19,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2025-01-10 02:29:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 02:29:19,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:19,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:19,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:29:19,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:19,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1780979344, now seen corresponding path program 1 times [2025-01-10 02:29:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:19,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653486845] [2025-01-10 02:29:19,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:19,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 02:29:19,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 02:29:19,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:19,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:29:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:19,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653486845] [2025-01-10 02:29:19,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653486845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:19,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:19,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:29:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058483306] [2025-01-10 02:29:19,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:19,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:29:19,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:19,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:29:19,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:29:19,855 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:19,947 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2025-01-10 02:29:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:29:19,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-01-10 02:29:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:19,948 INFO L225 Difference]: With dead ends: 168 [2025-01-10 02:29:19,948 INFO L226 Difference]: Without dead ends: 140 [2025-01-10 02:29:19,949 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 02:29:19,949 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:19,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 144 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:19,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-10 02:29:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-01-10 02:29:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 85 states have (on average 1.5411764705882354) internal successors, (131), 130 states have internal predecessors, (131), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:29:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2025-01-10 02:29:19,956 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 34 [2025-01-10 02:29:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:19,956 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2025-01-10 02:29:19,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2025-01-10 02:29:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 02:29:19,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:19,957 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:19,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:29:19,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:19,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:19,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1775119788, now seen corresponding path program 1 times [2025-01-10 02:29:19,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:19,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321685265] [2025-01-10 02:29:19,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:19,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:19,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 02:29:19,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 02:29:19,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:19,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:20,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:20,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321685265] [2025-01-10 02:29:20,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321685265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:20,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:20,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:29:20,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123904055] [2025-01-10 02:29:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:20,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:29:20,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:20,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:29:20,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:20,048 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:29:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:20,142 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2025-01-10 02:29:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:29:20,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-01-10 02:29:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:20,143 INFO L225 Difference]: With dead ends: 143 [2025-01-10 02:29:20,144 INFO L226 Difference]: Without dead ends: 142 [2025-01-10 02:29:20,145 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 02:29:20,145 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:20,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 207 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-10 02:29:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-01-10 02:29:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.5348837209302326) internal successors, (132), 131 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:29:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2025-01-10 02:29:20,152 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 47 [2025-01-10 02:29:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:20,152 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2025-01-10 02:29:20,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:29:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2025-01-10 02:29:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 02:29:20,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:20,154 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:20,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:29:20,155 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:20,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash 805861526, now seen corresponding path program 1 times [2025-01-10 02:29:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:20,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014307882] [2025-01-10 02:29:20,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:20,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 02:29:20,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 02:29:20,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:20,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:20,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:20,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014307882] [2025-01-10 02:29:20,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014307882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:20,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:20,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:29:20,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919220350] [2025-01-10 02:29:20,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:20,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:29:20,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:20,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:29:20,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:20,252 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:29:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:20,327 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2025-01-10 02:29:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:29:20,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-01-10 02:29:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:20,328 INFO L225 Difference]: With dead ends: 143 [2025-01-10 02:29:20,328 INFO L226 Difference]: Without dead ends: 142 [2025-01-10 02:29:20,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:20,329 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:20,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-10 02:29:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-01-10 02:29:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.528735632183908) internal successors, (133), 132 states have internal predecessors, (133), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:29:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2025-01-10 02:29:20,336 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 48 [2025-01-10 02:29:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:20,336 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2025-01-10 02:29:20,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:29:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2025-01-10 02:29:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 02:29:20,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:20,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:20,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:29:20,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:20,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:20,338 INFO L85 PathProgramCache]: Analyzing trace with hash -788096426, now seen corresponding path program 1 times [2025-01-10 02:29:20,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:20,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997716329] [2025-01-10 02:29:20,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:20,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:20,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 02:29:20,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 02:29:20,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:20,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:20,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:20,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997716329] [2025-01-10 02:29:20,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997716329] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:20,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460122176] [2025-01-10 02:29:20,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:20,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:20,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:20,393 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 02:29:20,394 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 02:29:20,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 02:29:20,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 02:29:20,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:20,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:20,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:29:20,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:20,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:29:20,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460122176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:20,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:29:20,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:29:20,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861487652] [2025-01-10 02:29:20,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:20,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:29:20,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:20,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:29:20,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:29:20,487 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:29:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:20,550 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2025-01-10 02:29:20,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:29:20,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-01-10 02:29:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:20,551 INFO L225 Difference]: With dead ends: 142 [2025-01-10 02:29:20,551 INFO L226 Difference]: Without dead ends: 133 [2025-01-10 02:29:20,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:29:20,552 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 120 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:20,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 117 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-10 02:29:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-01-10 02:29:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 123 states have internal predecessors, (124), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:29:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2025-01-10 02:29:20,556 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 49 [2025-01-10 02:29:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:20,557 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2025-01-10 02:29:20,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:29:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2025-01-10 02:29:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 02:29:20,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:20,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:20,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 02:29:20,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:20,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:20,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1338814616, now seen corresponding path program 1 times [2025-01-10 02:29:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:20,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358597638] [2025-01-10 02:29:20,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:20,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:20,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 02:29:20,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 02:29:20,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:20,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:20,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:20,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358597638] [2025-01-10 02:29:20,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358597638] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:20,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006868430] [2025-01-10 02:29:20,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:20,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:20,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:20,818 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 02:29:20,819 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 02:29:20,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 02:29:20,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 02:29:20,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:20,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:20,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:29:20,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:20,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:20,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006868430] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:20,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:20,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:29:20,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528479841] [2025-01-10 02:29:20,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:20,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:29:20,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:20,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:29:20,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:29:20,978 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand has 7 states, 6 states have (on average 16.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:29:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:21,086 INFO L93 Difference]: Finished difference Result 226 states and 255 transitions. [2025-01-10 02:29:21,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:21,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 50 [2025-01-10 02:29:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:21,087 INFO L225 Difference]: With dead ends: 226 [2025-01-10 02:29:21,087 INFO L226 Difference]: Without dead ends: 217 [2025-01-10 02:29:21,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:29:21,088 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 180 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:21,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 206 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-10 02:29:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 124. [2025-01-10 02:29:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 114 states have internal predecessors, (115), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:29:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2025-01-10 02:29:21,094 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 50 [2025-01-10 02:29:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:21,094 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2025-01-10 02:29:21,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:29:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2025-01-10 02:29:21,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 02:29:21,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:21,095 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:21,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:21,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:21,296 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:21,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:21,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1590448804, now seen corresponding path program 1 times [2025-01-10 02:29:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:21,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284704935] [2025-01-10 02:29:21,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:21,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:21,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 02:29:21,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 02:29:21,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:21,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:29:21,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656743075] [2025-01-10 02:29:21,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:21,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:21,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:21,315 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 02:29:21,317 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 02:29:21,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 02:29:21,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 02:29:21,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:21,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:21,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:29:21,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:29:21,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:29:21,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:21,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284704935] [2025-01-10 02:29:21,544 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:29:21,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656743075] [2025-01-10 02:29:21,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656743075] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:21,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:29:21,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 02:29:21,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350841966] [2025-01-10 02:29:21,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:21,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:29:21,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:21,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:29:21,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:29:21,545 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 02:29:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:21,683 INFO L93 Difference]: Finished difference Result 300 states and 322 transitions. [2025-01-10 02:29:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:21,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 63 [2025-01-10 02:29:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:21,687 INFO L225 Difference]: With dead ends: 300 [2025-01-10 02:29:21,687 INFO L226 Difference]: Without dead ends: 298 [2025-01-10 02:29:21,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:29:21,688 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 237 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:21,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 305 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-01-10 02:29:21,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 198. [2025-01-10 02:29:21,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 155 states have (on average 1.3806451612903226) internal successors, (214), 181 states have internal predecessors, (214), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-10 02:29:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 244 transitions. [2025-01-10 02:29:21,696 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 244 transitions. Word has length 63 [2025-01-10 02:29:21,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:21,697 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 244 transitions. [2025-01-10 02:29:21,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 02:29:21,697 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2025-01-10 02:29:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 02:29:21,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:21,698 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:21,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:21,898 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,SelfDestructingSolverStorable10 [2025-01-10 02:29:21,898 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:21,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:21,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1776332102, now seen corresponding path program 1 times [2025-01-10 02:29:21,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:21,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120659392] [2025-01-10 02:29:21,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:21,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:21,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 02:29:21,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 02:29:21,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:21,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:29:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044149991] [2025-01-10 02:29:21,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:21,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:21,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:21,918 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 02:29:21,919 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 02:29:21,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 02:29:21,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 02:29:21,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:21,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:21,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:29:21,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:22,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:22,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:22,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120659392] [2025-01-10 02:29:22,119 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:29:22,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044149991] [2025-01-10 02:29:22,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044149991] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:22,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:29:22,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 02:29:22,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065761807] [2025-01-10 02:29:22,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:22,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:29:22,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:22,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:29:22,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:29:22,120 INFO L87 Difference]: Start difference. First operand 198 states and 244 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-10 02:29:22,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:22,320 INFO L93 Difference]: Finished difference Result 258 states and 321 transitions. [2025-01-10 02:29:22,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:22,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 70 [2025-01-10 02:29:22,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:22,322 INFO L225 Difference]: With dead ends: 258 [2025-01-10 02:29:22,323 INFO L226 Difference]: Without dead ends: 250 [2025-01-10 02:29:22,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:29:22,323 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 218 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:22,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 208 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-10 02:29:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 194. [2025-01-10 02:29:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 157 states have (on average 1.267515923566879) internal successors, (199), 176 states have internal predecessors, (199), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 02:29:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 231 transitions. [2025-01-10 02:29:22,336 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 231 transitions. Word has length 70 [2025-01-10 02:29:22,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:22,337 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 231 transitions. [2025-01-10 02:29:22,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-10 02:29:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 231 transitions. [2025-01-10 02:29:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 02:29:22,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:22,339 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:22,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:22,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 02:29:22,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:22,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:22,541 INFO L85 PathProgramCache]: Analyzing trace with hash 768279756, now seen corresponding path program 1 times [2025-01-10 02:29:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:22,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023297100] [2025-01-10 02:29:22,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:22,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:22,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 02:29:22,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 02:29:22,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:22,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:22,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:22,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023297100] [2025-01-10 02:29:22,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023297100] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:22,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827165385] [2025-01-10 02:29:22,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:22,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:22,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:22,651 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 02:29:22,653 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 02:29:22,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 02:29:22,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 02:29:22,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:22,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:22,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:29:22,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:22,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:22,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827165385] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:22,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:22,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 02:29:22,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483219319] [2025-01-10 02:29:22,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:22,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:29:22,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:22,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:29:22,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:29:22,917 INFO L87 Difference]: Start difference. First operand 194 states and 231 transitions. Second operand has 10 states, 9 states have (on average 13.555555555555555) internal successors, (122), 10 states have internal predecessors, (122), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:29:23,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:23,073 INFO L93 Difference]: Finished difference Result 194 states and 231 transitions. [2025-01-10 02:29:23,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:23,073 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.555555555555555) internal successors, (122), 10 states have internal predecessors, (122), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 71 [2025-01-10 02:29:23,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:23,074 INFO L225 Difference]: With dead ends: 194 [2025-01-10 02:29:23,074 INFO L226 Difference]: Without dead ends: 191 [2025-01-10 02:29:23,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:29:23,074 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 159 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:23,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 192 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-10 02:29:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-01-10 02:29:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 157 states have (on average 1.2229299363057324) internal successors, (192), 173 states have internal predecessors, (192), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 02:29:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 224 transitions. [2025-01-10 02:29:23,085 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 224 transitions. Word has length 71 [2025-01-10 02:29:23,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:23,085 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 224 transitions. [2025-01-10 02:29:23,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.555555555555555) internal successors, (122), 10 states have internal predecessors, (122), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:29:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 224 transitions. [2025-01-10 02:29:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 02:29:23,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:23,086 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:23,092 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 02:29:23,286 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,SelfDestructingSolverStorable12 [2025-01-10 02:29:23,287 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:23,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1953131268, now seen corresponding path program 1 times [2025-01-10 02:29:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:23,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287948291] [2025-01-10 02:29:23,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:23,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:23,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 02:29:23,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 02:29:23,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:23,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:23,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287948291] [2025-01-10 02:29:23,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287948291] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473040531] [2025-01-10 02:29:23,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:23,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:23,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:23,361 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 02:29:23,362 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 02:29:23,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 02:29:23,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 02:29:23,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:23,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:23,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:29:23,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:23,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:23,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473040531] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:23,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:23,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 02:29:23,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814047807] [2025-01-10 02:29:23,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:23,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:29:23,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:23,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:29:23,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:29:23,590 INFO L87 Difference]: Start difference. First operand 191 states and 224 transitions. Second operand has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 10 states have internal predecessors, (124), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:29:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:23,764 INFO L93 Difference]: Finished difference Result 217 states and 256 transitions. [2025-01-10 02:29:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:29:23,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 10 states have internal predecessors, (124), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 72 [2025-01-10 02:29:23,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:23,766 INFO L225 Difference]: With dead ends: 217 [2025-01-10 02:29:23,766 INFO L226 Difference]: Without dead ends: 208 [2025-01-10 02:29:23,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:29:23,767 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 96 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:23,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 222 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:23,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-10 02:29:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 184. [2025-01-10 02:29:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 157 states have (on average 1.1210191082802548) internal successors, (176), 166 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 02:29:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2025-01-10 02:29:23,775 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 72 [2025-01-10 02:29:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:23,775 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2025-01-10 02:29:23,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 10 states have internal predecessors, (124), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:29:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2025-01-10 02:29:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 02:29:23,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:23,779 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:23,786 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 02:29:23,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:23,981 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:23,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash -58437826, now seen corresponding path program 1 times [2025-01-10 02:29:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:23,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666812425] [2025-01-10 02:29:23,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:23,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:23,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 02:29:23,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 02:29:23,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:23,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:24,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:24,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666812425] [2025-01-10 02:29:24,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666812425] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:24,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450208957] [2025-01-10 02:29:24,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:24,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:24,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:24,076 INFO L229 MonitoredProcess]: Starting monitored process 9 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 02:29:24,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 02:29:24,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 02:29:24,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 02:29:24,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:24,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:24,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:29:24,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:24,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:29:24,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450208957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:24,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:29:24,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 02:29:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246899320] [2025-01-10 02:29:24,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:24,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:29:24,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:24,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:29:24,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:29:24,296 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:29:24,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:24,370 INFO L93 Difference]: Finished difference Result 184 states and 208 transitions. [2025-01-10 02:29:24,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:24,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2025-01-10 02:29:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:24,372 INFO L225 Difference]: With dead ends: 184 [2025-01-10 02:29:24,372 INFO L226 Difference]: Without dead ends: 154 [2025-01-10 02:29:24,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:29:24,372 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:24,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 107 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-10 02:29:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-01-10 02:29:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.037037037037037) internal successors, (140), 138 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-10 02:29:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2025-01-10 02:29:24,380 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 74 [2025-01-10 02:29:24,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:24,380 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2025-01-10 02:29:24,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:29:24,380 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2025-01-10 02:29:24,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-10 02:29:24,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:24,381 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 02:29:24,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:24,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 02:29:24,581 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:24,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:24,582 INFO L85 PathProgramCache]: Analyzing trace with hash -591437574, now seen corresponding path program 1 times [2025-01-10 02:29:24,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:24,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596079181] [2025-01-10 02:29:24,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:24,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:24,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-10 02:29:24,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-10 02:29:24,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:24,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-10 02:29:24,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:24,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596079181] [2025-01-10 02:29:24,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596079181] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:24,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818340419] [2025-01-10 02:29:24,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:24,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:24,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:24,710 INFO L229 MonitoredProcess]: Starting monitored process 10 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 02:29:24,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 02:29:24,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-10 02:29:24,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-10 02:29:24,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:24,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:24,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:29:24,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-10 02:29:25,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-10 02:29:25,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818340419] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:25,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:25,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-01-10 02:29:25,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699095151] [2025-01-10 02:29:25,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:25,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 02:29:25,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:25,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 02:29:25,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-01-10 02:29:25,226 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 20 states, 19 states have (on average 14.210526315789474) internal successors, (270), 20 states have internal predecessors, (270), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-01-10 02:29:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:25,462 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2025-01-10 02:29:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:29:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 14.210526315789474) internal successors, (270), 20 states have internal predecessors, (270), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 136 [2025-01-10 02:29:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:25,465 INFO L225 Difference]: With dead ends: 239 [2025-01-10 02:29:25,465 INFO L226 Difference]: Without dead ends: 238 [2025-01-10 02:29:25,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:29:25,467 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:25,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-01-10 02:29:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2025-01-10 02:29:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 210 states have (on average 1.0523809523809524) internal successors, (221), 213 states have internal predecessors, (221), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-10 02:29:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 263 transitions. [2025-01-10 02:29:25,479 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 263 transitions. Word has length 136 [2025-01-10 02:29:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:25,479 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 263 transitions. [2025-01-10 02:29:25,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 14.210526315789474) internal successors, (270), 20 states have internal predecessors, (270), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-01-10 02:29:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 263 transitions. [2025-01-10 02:29:25,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-10 02:29:25,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:25,482 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-01-10 02:29:25,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 02:29:25,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:25,686 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:25,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:25,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1592955232, now seen corresponding path program 2 times [2025-01-10 02:29:25,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:25,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381212091] [2025-01-10 02:29:25,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:25,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:25,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-01-10 02:29:25,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-01-10 02:29:25,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:25,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-10 02:29:25,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:25,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381212091] [2025-01-10 02:29:25,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381212091] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:25,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127929494] [2025-01-10 02:29:25,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:25,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:25,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:25,864 INFO L229 MonitoredProcess]: Starting monitored process 11 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 02:29:25,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 02:29:25,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-01-10 02:29:25,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-01-10 02:29:25,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:25,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:25,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:29:25,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-10 02:29:26,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-10 02:29:26,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127929494] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:26,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:26,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-01-10 02:29:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164014833] [2025-01-10 02:29:26,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:26,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 02:29:26,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:26,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 02:29:26,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:29:26,404 INFO L87 Difference]: Start difference. First operand 236 states and 263 transitions. Second operand has 22 states, 21 states have (on average 14.19047619047619) internal successors, (298), 22 states have internal predecessors, (298), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-01-10 02:29:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:26,734 INFO L93 Difference]: Finished difference Result 257 states and 284 transitions. [2025-01-10 02:29:26,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 02:29:26,735 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 14.19047619047619) internal successors, (298), 22 states have internal predecessors, (298), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 160 [2025-01-10 02:29:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:26,736 INFO L225 Difference]: With dead ends: 257 [2025-01-10 02:29:26,737 INFO L226 Difference]: Without dead ends: 256 [2025-01-10 02:29:26,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2025-01-10 02:29:26,738 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 75 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:26,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 264 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-10 02:29:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2025-01-10 02:29:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 224 states have (on average 1.0446428571428572) internal successors, (234), 227 states have internal predecessors, (234), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-10 02:29:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 280 transitions. [2025-01-10 02:29:26,751 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 280 transitions. Word has length 160 [2025-01-10 02:29:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:26,752 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 280 transitions. [2025-01-10 02:29:26,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 14.19047619047619) internal successors, (298), 22 states have internal predecessors, (298), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-01-10 02:29:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 280 transitions. [2025-01-10 02:29:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-10 02:29:26,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:26,753 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-10 02:29:26,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:26,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 02:29:26,954 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:26,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash 443673550, now seen corresponding path program 2 times [2025-01-10 02:29:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:26,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110401632] [2025-01-10 02:29:26,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:26,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 195 statements into 2 equivalence classes. [2025-01-10 02:29:26,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 02:29:26,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:26,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:29:26,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1186275074] [2025-01-10 02:29:26,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:26,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:26,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:26,992 INFO L229 MonitoredProcess]: Starting monitored process 12 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 02:29:26,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 02:29:27,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 195 statements into 2 equivalence classes. [2025-01-10 02:29:27,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 02:29:27,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:27,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:27,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 02:29:27,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-10 02:29:27,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-10 02:29:27,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:27,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110401632] [2025-01-10 02:29:27,474 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:29:27,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186275074] [2025-01-10 02:29:27,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186275074] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:27,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:29:27,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-10 02:29:27,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303676322] [2025-01-10 02:29:27,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:27,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:29:27,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:27,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:29:27,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:29:27,477 INFO L87 Difference]: Start difference. First operand 252 states and 280 transitions. Second operand has 12 states, 11 states have (on average 23.636363636363637) internal successors, (260), 12 states have internal predecessors, (260), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-01-10 02:29:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:27,802 INFO L93 Difference]: Finished difference Result 354 states and 389 transitions. [2025-01-10 02:29:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:29:27,802 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 23.636363636363637) internal successors, (260), 12 states have internal predecessors, (260), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 195 [2025-01-10 02:29:27,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:27,804 INFO L225 Difference]: With dead ends: 354 [2025-01-10 02:29:27,804 INFO L226 Difference]: Without dead ends: 353 [2025-01-10 02:29:27,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:29:27,804 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 142 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:27,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 661 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-10 02:29:27,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 343. [2025-01-10 02:29:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 307 states have (on average 1.0456026058631922) internal successors, (321), 310 states have internal predecessors, (321), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-10 02:29:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 383 transitions. [2025-01-10 02:29:27,816 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 383 transitions. Word has length 195 [2025-01-10 02:29:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:27,816 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 383 transitions. [2025-01-10 02:29:27,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 23.636363636363637) internal successors, (260), 12 states have internal predecessors, (260), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-01-10 02:29:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 383 transitions. [2025-01-10 02:29:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-10 02:29:27,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:27,818 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-10 02:29:27,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 02:29:28,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:29:28,019 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:28,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:28,019 INFO L85 PathProgramCache]: Analyzing trace with hash 94172752, now seen corresponding path program 2 times [2025-01-10 02:29:28,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:28,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230436488] [2025-01-10 02:29:28,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:28,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:28,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-01-10 02:29:28,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-01-10 02:29:28,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:28,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:29:28,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1444439384] [2025-01-10 02:29:28,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:28,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:28,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:28,051 INFO L229 MonitoredProcess]: Starting monitored process 13 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 02:29:28,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 02:29:28,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-01-10 02:29:28,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-01-10 02:29:28,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:28,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:28,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 02:29:28,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-10 02:29:28,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-10 02:29:28,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:28,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230436488] [2025-01-10 02:29:28,498 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:29:28,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444439384] [2025-01-10 02:29:28,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444439384] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:28,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:29:28,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-10 02:29:28,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826869628] [2025-01-10 02:29:28,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:28,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:29:28,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:28,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:29:28,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:29:28,499 INFO L87 Difference]: Start difference. First operand 343 states and 383 transitions. Second operand has 12 states, 11 states have (on average 24.0) internal successors, (264), 12 states have internal predecessors, (264), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-01-10 02:29:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:28,816 INFO L93 Difference]: Finished difference Result 349 states and 388 transitions. [2025-01-10 02:29:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:29:28,816 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 24.0) internal successors, (264), 12 states have internal predecessors, (264), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 202 [2025-01-10 02:29:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:28,818 INFO L225 Difference]: With dead ends: 349 [2025-01-10 02:29:28,818 INFO L226 Difference]: Without dead ends: 348 [2025-01-10 02:29:28,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:29:28,819 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 98 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:28,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 619 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-10 02:29:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2025-01-10 02:29:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 309 states have (on average 1.029126213592233) internal successors, (318), 312 states have internal predecessors, (318), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-10 02:29:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 382 transitions. [2025-01-10 02:29:28,833 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 382 transitions. Word has length 202 [2025-01-10 02:29:28,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:28,833 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 382 transitions. [2025-01-10 02:29:28,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 24.0) internal successors, (264), 12 states have internal predecessors, (264), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-01-10 02:29:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 382 transitions. [2025-01-10 02:29:28,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-10 02:29:28,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:28,836 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1] [2025-01-10 02:29:28,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 02:29:29,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:29,036 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:29,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash -861663806, now seen corresponding path program 2 times [2025-01-10 02:29:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:29,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022144227] [2025-01-10 02:29:29,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:29,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 312 statements into 2 equivalence classes. [2025-01-10 02:29:29,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 312 of 312 statements. [2025-01-10 02:29:29,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:29,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2025-01-10 02:29:29,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:29,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022144227] [2025-01-10 02:29:29,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022144227] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:29,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863687651] [2025-01-10 02:29:29,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:29,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:29,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:29,179 INFO L229 MonitoredProcess]: Starting monitored process 14 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 02:29:29,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 02:29:29,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 312 statements into 2 equivalence classes. [2025-01-10 02:29:29,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 312 of 312 statements. [2025-01-10 02:29:29,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:29,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:29,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:29:29,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2025-01-10 02:29:29,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2025-01-10 02:29:29,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863687651] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:29,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:29,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 02:29:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075436627] [2025-01-10 02:29:29,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:29,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 02:29:29,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:29,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 02:29:29,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:29:29,757 INFO L87 Difference]: Start difference. First operand 346 states and 382 transitions. Second operand has 13 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-10 02:29:29,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:29,847 INFO L93 Difference]: Finished difference Result 346 states and 382 transitions. [2025-01-10 02:29:29,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:29:29,847 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 312 [2025-01-10 02:29:29,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:29,849 INFO L225 Difference]: With dead ends: 346 [2025-01-10 02:29:29,849 INFO L226 Difference]: Without dead ends: 345 [2025-01-10 02:29:29,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:29:29,849 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 187 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:29,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 72 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-01-10 02:29:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-01-10 02:29:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 309 states have (on average 1.0161812297734627) internal successors, (314), 311 states have internal predecessors, (314), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-10 02:29:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 378 transitions. [2025-01-10 02:29:29,863 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 378 transitions. Word has length 312 [2025-01-10 02:29:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:29,863 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 378 transitions. [2025-01-10 02:29:29,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-10 02:29:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 378 transitions. [2025-01-10 02:29:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-10 02:29:29,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:29,866 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2025-01-10 02:29:29,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:30,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:30,068 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:30,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1672518104, now seen corresponding path program 3 times [2025-01-10 02:29:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:30,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025700085] [2025-01-10 02:29:30,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:29:30,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:30,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 336 statements into 13 equivalence classes. [2025-01-10 02:29:30,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 121 of 336 statements. [2025-01-10 02:29:30,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 02:29:30,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 51 proven. 414 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2025-01-10 02:29:30,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:30,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025700085] [2025-01-10 02:29:30,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025700085] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:30,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217772712] [2025-01-10 02:29:30,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:29:30,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:30,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:30,321 INFO L229 MonitoredProcess]: Starting monitored process 15 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 02:29:30,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 02:29:30,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 336 statements into 13 equivalence classes. [2025-01-10 02:29:30,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 44 of 336 statements. [2025-01-10 02:29:30,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 02:29:30,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:30,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 02:29:30,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 126 proven. 148 refuted. 0 times theorem prover too weak. 1522 trivial. 0 not checked. [2025-01-10 02:29:31,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:31,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217772712] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:31,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:29:31,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-01-10 02:29:31,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576619572] [2025-01-10 02:29:31,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:31,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 02:29:31,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:31,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 02:29:31,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-01-10 02:29:31,411 INFO L87 Difference]: Start difference. First operand 345 states and 378 transitions. Second operand has 19 states, 18 states have (on average 8.555555555555555) internal successors, (154), 19 states have internal predecessors, (154), 7 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-10 02:29:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:31,824 INFO L93 Difference]: Finished difference Result 345 states and 378 transitions. [2025-01-10 02:29:31,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 02:29:31,824 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 8.555555555555555) internal successors, (154), 19 states have internal predecessors, (154), 7 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 336 [2025-01-10 02:29:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:31,826 INFO L225 Difference]: With dead ends: 345 [2025-01-10 02:29:31,826 INFO L226 Difference]: Without dead ends: 344 [2025-01-10 02:29:31,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 02:29:31,827 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 260 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:31,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 93 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-01-10 02:29:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-01-10 02:29:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 309 states have (on average 1.006472491909385) internal successors, (311), 310 states have internal predecessors, (311), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-10 02:29:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 375 transitions. [2025-01-10 02:29:31,848 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 375 transitions. Word has length 336 [2025-01-10 02:29:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:31,848 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 375 transitions. [2025-01-10 02:29:31,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 8.555555555555555) internal successors, (154), 19 states have internal predecessors, (154), 7 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-10 02:29:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 375 transitions. [2025-01-10 02:29:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-10 02:29:31,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:31,855 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-01-10 02:29:31,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:32,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-10 02:29:32,059 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:32,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:32,060 INFO L85 PathProgramCache]: Analyzing trace with hash -251408606, now seen corresponding path program 3 times [2025-01-10 02:29:32,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:32,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422306364] [2025-01-10 02:29:32,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:29:32,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:32,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 459 statements into 16 equivalence classes. [2025-01-10 02:29:32,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 459 of 459 statements. [2025-01-10 02:29:32,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-01-10 02:29:32,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:29:32,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313376215] [2025-01-10 02:29:32,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:29:32,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:32,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:32,187 INFO L229 MonitoredProcess]: Starting monitored process 16 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 02:29:32,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 02:29:32,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 459 statements into 16 equivalence classes. [2025-01-10 02:29:32,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 68 of 459 statements. [2025-01-10 02:29:32,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 02:29:32,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:32,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 02:29:32,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3410 backedges. 228 proven. 164 refuted. 0 times theorem prover too weak. 3018 trivial. 0 not checked. [2025-01-10 02:29:33,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:34,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422306364] [2025-01-10 02:29:34,933 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:29:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313376215] [2025-01-10 02:29:34,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313376215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:34,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:29:34,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-01-10 02:29:34,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821248832] [2025-01-10 02:29:34,934 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:34,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 02:29:34,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:34,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 02:29:34,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:29:34,935 INFO L87 Difference]: Start difference. First operand 344 states and 375 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 02:29:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:35,376 INFO L93 Difference]: Finished difference Result 346 states and 377 transitions. [2025-01-10 02:29:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:29:35,377 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 459 [2025-01-10 02:29:35,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:35,377 INFO L225 Difference]: With dead ends: 346 [2025-01-10 02:29:35,377 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:29:35,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-01-10 02:29:35,379 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 165 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:35,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 55 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:29:35,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:29:35,379 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 02:29:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:29:35,379 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 459 [2025-01-10 02:29:35,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:35,380 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:29:35,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 02:29:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:29:35,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 50 remaining) [2025-01-10 02:29:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 50 remaining) [2025-01-10 02:29:35,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 50 remaining) [2025-01-10 02:29:35,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 50 remaining) [2025-01-10 02:29:35,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 50 remaining) [2025-01-10 02:29:35,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 50 remaining) [2025-01-10 02:29:35,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 50 remaining) [2025-01-10 02:29:35,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 50 remaining) [2025-01-10 02:29:35,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 50 remaining) [2025-01-10 02:29:35,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 50 remaining) [2025-01-10 02:29:35,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 50 remaining) [2025-01-10 02:29:35,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 50 remaining) [2025-01-10 02:29:35,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 50 remaining) [2025-01-10 02:29:35,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 02:29:35,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:35,593 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:35,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:29:36,506 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:29:36,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:29:36 BoogieIcfgContainer [2025-01-10 02:29:36,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:29:36,520 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:29:36,520 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:29:36,520 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:29:36,520 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:29:18" (3/4) ... [2025-01-10 02:29:36,522 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:29:36,527 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 02:29:36,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 02:29:36,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 02:29:36,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 02:29:36,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:29:36,589 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:29:36,590 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:29:36,590 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:29:36,590 INFO L158 Benchmark]: Toolchain (without parser) took 18617.12ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 133.2MB in the beginning and 177.1MB in the end (delta: -43.9MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2025-01-10 02:29:36,590 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:29:36,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.63ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 122.1MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:29:36,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.22ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 120.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:29:36,591 INFO L158 Benchmark]: Boogie Preprocessor took 36.88ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 119.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:29:36,591 INFO L158 Benchmark]: RCFGBuilder took 324.73ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 100.8MB in the end (delta: 18.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 02:29:36,591 INFO L158 Benchmark]: TraceAbstraction took 17999.38ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 100.4MB in the beginning and 182.8MB in the end (delta: -82.4MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. [2025-01-10 02:29:36,592 INFO L158 Benchmark]: Witness Printer took 69.84ms. Allocated memory is still 243.3MB. Free memory was 182.8MB in the beginning and 177.1MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:29:36,592 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.63ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 122.1MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.22ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 120.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.88ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 119.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 324.73ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 100.8MB in the end (delta: 18.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17999.38ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 100.4MB in the beginning and 182.8MB in the end (delta: -82.4MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. * Witness Printer took 69.84ms. Allocated memory is still 243.3MB. Free memory was 182.8MB in the beginning and 177.1MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: 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 2 procedures, 121 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 22, TraceHistogramMax: 31, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2292 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2233 mSDsluCounter, 4614 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3055 mSDsCounter, 303 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3659 IncrementalHoareTripleChecker+Invalid, 3962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 303 mSolverCounterUnsat, 1559 mSDtfsCounter, 3659 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3767 GetRequests, 3563 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=19, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 341 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 4746 NumberOfCodeBlocks, 3848 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 5021 ConstructedInterpolants, 4 QuantifiedInterpolants, 21065 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2652 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 41 InterpolantComputations, 10 PerfectInterpolantSequences, 13643/16405 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 50 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((n <= 100) && (t == 1)) && (a == 0)) && (0 <= n)) && (s == 1)) || (((((((((((((((__int128) t * t) + ((__int128) -2 * t)) + 1) >= 0) ? (((((__int128) t * t) + ((__int128) -2 * t)) + 1) / 4) : ((((((__int128) t * t) + ((__int128) -2 * t)) + 1) / 4) - 1)) <= 100) && (((((((__int128) t * t) + ((__int128) 2 * t)) + 1) >= 0) ? (((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) : ((((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) + 4)) == 0)) && (n <= 100)) && (((__int128) t + 1) <= s)) && (3 <= t)) && (1 <= a)) && (a <= 4611686018427387903)) && (s <= ((__int128) t + 100))) && (0 <= n))) RESULT: Ultimate proved your program to be correct! [2025-01-10 02:29:36,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE