./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-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/ps6-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 b8588da8d66d82eb7aa3eaf3ef7c4d24b2b275bf9c1acdf38a110c8bc6eba3b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:27:51,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:27:52,031 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:27:52,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:27:52,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:27:52,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:27:52,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:27:52,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:27:52,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:27:52,061 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:27:52,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:27:52,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:27:52,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:27:52,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:27:52,062 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:27:52,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:27:52,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:27:52,062 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:27:52,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:27:52,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:27:52,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:27:52,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:27:52,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:27:52,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:27:52,063 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:27:52,063 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:27:52,063 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:27:52,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:27:52,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:27:52,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:27:52,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:27:52,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:27:52,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:27:52,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:27:52,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:27:52,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:27:52,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:27:52,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:27:52,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:27:52,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:27:52,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:27:52,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:27:52,064 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:27:52,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:27:52,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:27:52,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:27:52,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:27:52,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:27:52,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:27:52,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:27:52,065 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 -> b8588da8d66d82eb7aa3eaf3ef7c4d24b2b275bf9c1acdf38a110c8bc6eba3b7 [2025-01-10 02:27:52,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:27:52,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:27:52,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:27:52,285 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:27:52,285 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:27:52,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c [2025-01-10 02:27:53,470 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a230bf126/667dab0dd6b04f9b8c00fda6adf6ca97/FLAGf7a809f02 [2025-01-10 02:27:53,719 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:27:53,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c [2025-01-10 02:27:53,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a230bf126/667dab0dd6b04f9b8c00fda6adf6ca97/FLAGf7a809f02 [2025-01-10 02:27:54,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a230bf126/667dab0dd6b04f9b8c00fda6adf6ca97 [2025-01-10 02:27:54,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:27:54,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:27:54,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:27:54,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:27:54,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:27:54,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:27:54" (1/1) ... [2025-01-10 02:27:54,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791212dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54, skipping insertion in model container [2025-01-10 02:27:54,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:27:54" (1/1) ... [2025-01-10 02:27:54,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:27:54,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:27:54,196 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:27:54,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:27:54,222 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:27:54,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54 WrapperNode [2025-01-10 02:27:54,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:27:54,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:27:54,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:27:54,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:27:54,227 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:27:54" (1/1) ... [2025-01-10 02:27:54,231 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:27:54" (1/1) ... [2025-01-10 02:27:54,245 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2025-01-10 02:27:54,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:27:54,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:27:54,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:27:54,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:27:54,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54" (1/1) ... [2025-01-10 02:27:54,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54" (1/1) ... [2025-01-10 02:27:54,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54" (1/1) ... [2025-01-10 02:27:54,268 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:27:54,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54" (1/1) ... [2025-01-10 02:27:54,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54" (1/1) ... [2025-01-10 02:27:54,274 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54" (1/1) ... [2025-01-10 02:27:54,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54" (1/1) ... [2025-01-10 02:27:54,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54" (1/1) ... [2025-01-10 02:27:54,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54" (1/1) ... [2025-01-10 02:27:54,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54" (1/1) ... [2025-01-10 02:27:54,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:27:54,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:27:54,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:27:54,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:27:54,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54" (1/1) ... [2025-01-10 02:27:54,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:27:54,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:54,320 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:27:54,324 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:27:54,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:27:54,337 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 02:27:54,337 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 02:27:54,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:27:54,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:27:54,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:27:54,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:27:54,337 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:27:54,370 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:27:54,372 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:27:54,770 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-01-10 02:27:54,771 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:27:54,788 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:27:54,788 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:27:54,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:27:54 BoogieIcfgContainer [2025-01-10 02:27:54,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:27:54,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:27:54,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:27:54,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:27:54,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:27:54" (1/3) ... [2025-01-10 02:27:54,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c26276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:27:54, skipping insertion in model container [2025-01-10 02:27:54,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:54" (2/3) ... [2025-01-10 02:27:54,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c26276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:27:54, skipping insertion in model container [2025-01-10 02:27:54,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:27:54" (3/3) ... [2025-01-10 02:27:54,797 INFO L128 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound100.c [2025-01-10 02:27:54,807 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:27:54,808 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps6-ll_valuebound100.c that has 3 procedures, 227 locations, 1 initial locations, 1 loop locations, and 102 error locations. [2025-01-10 02:27:54,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:27:54,860 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;@54ebc275, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:27:54,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2025-01-10 02:27:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 117 states have (on average 1.9059829059829059) internal successors, (223), 219 states have internal predecessors, (223), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:27:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 02:27:54,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:54,868 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:54,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-01-10 02:27:54,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash 349241227, now seen corresponding path program 1 times [2025-01-10 02:27:54,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:54,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748392285] [2025-01-10 02:27:54,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:54,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:54,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:27:54,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:27:54,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:54,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:27:54,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:54,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748392285] [2025-01-10 02:27:54,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748392285] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:54,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659110852] [2025-01-10 02:27:54,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:54,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:54,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:54,958 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:27:54,959 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:27:54,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:27:54,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:27:54,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:54,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:54,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-10 02:27:54,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:27:54,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:27:54,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659110852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:54,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:27:54,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-10 02:27:55,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712239404] [2025-01-10 02:27:55,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:55,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:27:55,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:55,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:27:55,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:27:55,018 INFO L87 Difference]: Start difference. First operand has 227 states, 117 states have (on average 1.9059829059829059) internal successors, (223), 219 states have internal predecessors, (223), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:27:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:55,040 INFO L93 Difference]: Finished difference Result 425 states and 466 transitions. [2025-01-10 02:27:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:27:55,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-01-10 02:27:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:55,045 INFO L225 Difference]: With dead ends: 425 [2025-01-10 02:27:55,046 INFO L226 Difference]: Without dead ends: 195 [2025-01-10 02:27:55,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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:27:55,049 INFO L435 NwaCegarLoop]: 204 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, 204 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:27:55,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:55,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-10 02:27:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-01-10 02:27:55,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 112 states have (on average 1.6875) internal successors, (189), 188 states have internal predecessors, (189), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:27:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2025-01-10 02:27:55,103 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 14 [2025-01-10 02:27:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:55,104 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2025-01-10 02:27:55,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:27:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2025-01-10 02:27:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 02:27:55,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:55,105 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:55,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:27:55,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-10 02:27:55,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-01-10 02:27:55,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:55,307 INFO L85 PathProgramCache]: Analyzing trace with hash -41938741, now seen corresponding path program 1 times [2025-01-10 02:27:55,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:55,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045197510] [2025-01-10 02:27:55,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:55,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:55,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:27:55,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:27:55,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:55,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:55,348 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:27:55,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:55,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045197510] [2025-01-10 02:27:55,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045197510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:55,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:55,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:27:55,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735967485] [2025-01-10 02:27:55,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:55,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:27:55,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:55,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:27:55,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:27:55,350 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:27:55,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:55,672 INFO L93 Difference]: Finished difference Result 355 states and 363 transitions. [2025-01-10 02:27:55,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:27:55,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 14 [2025-01-10 02:27:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:55,673 INFO L225 Difference]: With dead ends: 355 [2025-01-10 02:27:55,674 INFO L226 Difference]: Without dead ends: 291 [2025-01-10 02:27:55,674 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:27:55,674 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 98 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:55,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 137 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:27:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-01-10 02:27:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 285. [2025-01-10 02:27:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 201 states have (on average 1.4328358208955223) internal successors, (288), 277 states have internal predecessors, (288), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:27:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 298 transitions. [2025-01-10 02:27:55,685 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 298 transitions. Word has length 14 [2025-01-10 02:27:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:55,685 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 298 transitions. [2025-01-10 02:27:55,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:27:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 298 transitions. [2025-01-10 02:27:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-10 02:27:55,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:55,686 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:55,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:27:55,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-01-10 02:27:55,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:55,687 INFO L85 PathProgramCache]: Analyzing trace with hash -521769871, now seen corresponding path program 1 times [2025-01-10 02:27:55,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:55,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078618173] [2025-01-10 02:27:55,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:55,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:55,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 02:27:55,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 02:27:55,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:55,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:55,795 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:27:55,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:55,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078618173] [2025-01-10 02:27:55,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078618173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:55,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:55,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:27:55,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488636989] [2025-01-10 02:27:55,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:55,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:27:55,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:55,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:27:55,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:27:55,797 INFO L87 Difference]: Start difference. First operand 285 states and 298 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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:27:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:55,843 INFO L93 Difference]: Finished difference Result 309 states and 316 transitions. [2025-01-10 02:27:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:27:55,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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 52 [2025-01-10 02:27:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:55,845 INFO L225 Difference]: With dead ends: 309 [2025-01-10 02:27:55,845 INFO L226 Difference]: Without dead ends: 302 [2025-01-10 02:27:55,845 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:27:55,845 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 68 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:55,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 359 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-01-10 02:27:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 284. [2025-01-10 02:27:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 200 states have (on average 1.405) internal successors, (281), 276 states have internal predecessors, (281), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:27:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 291 transitions. [2025-01-10 02:27:55,854 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 291 transitions. Word has length 52 [2025-01-10 02:27:55,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:55,854 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 291 transitions. [2025-01-10 02:27:55,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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:27:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 291 transitions. [2025-01-10 02:27:55,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 02:27:55,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:55,855 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:55,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:27:55,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-01-10 02:27:55,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:55,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1090331379, now seen corresponding path program 1 times [2025-01-10 02:27:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:55,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680971622] [2025-01-10 02:27:55,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:55,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:55,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 02:27:55,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 02:27:55,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:55,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:55,943 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:27:55,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:55,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680971622] [2025-01-10 02:27:55,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680971622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:55,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:55,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:27:55,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590593072] [2025-01-10 02:27:55,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:55,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:55,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:55,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:55,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:27:55,945 INFO L87 Difference]: Start difference. First operand 284 states and 291 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 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:27:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:56,104 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2025-01-10 02:27:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:27:56,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 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 54 [2025-01-10 02:27:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:56,105 INFO L225 Difference]: With dead ends: 304 [2025-01-10 02:27:56,106 INFO L226 Difference]: Without dead ends: 261 [2025-01-10 02:27:56,106 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:27:56,106 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 150 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:56,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 284 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:27:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-10 02:27:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 243. [2025-01-10 02:27:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 235 states have internal predecessors, (238), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:27:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 248 transitions. [2025-01-10 02:27:56,114 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 248 transitions. Word has length 54 [2025-01-10 02:27:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:56,114 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 248 transitions. [2025-01-10 02:27:56,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 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:27:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 248 transitions. [2025-01-10 02:27:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 02:27:56,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:56,115 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:56,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:27:56,115 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-01-10 02:27:56,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:56,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1680580036, now seen corresponding path program 1 times [2025-01-10 02:27:56,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:56,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524763353] [2025-01-10 02:27:56,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:56,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:56,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 02:27:56,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 02:27:56,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:56,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:56,175 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:27:56,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:56,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524763353] [2025-01-10 02:27:56,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524763353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:56,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:56,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:27:56,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129623805] [2025-01-10 02:27:56,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:56,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:27:56,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:56,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:27:56,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:27:56,177 INFO L87 Difference]: Start difference. First operand 243 states and 248 transitions. Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:27:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:56,191 INFO L93 Difference]: Finished difference Result 245 states and 248 transitions. [2025-01-10 02:27:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:27:56,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2025-01-10 02:27:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:56,192 INFO L225 Difference]: With dead ends: 245 [2025-01-10 02:27:56,192 INFO L226 Difference]: Without dead ends: 243 [2025-01-10 02:27:56,192 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:27:56,193 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 1 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:56,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-10 02:27:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-01-10 02:27:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 159 states have (on average 1.4842767295597483) internal successors, (236), 235 states have internal predecessors, (236), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:27:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 246 transitions. [2025-01-10 02:27:56,201 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 246 transitions. Word has length 62 [2025-01-10 02:27:56,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:56,201 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 246 transitions. [2025-01-10 02:27:56,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:27:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 246 transitions. [2025-01-10 02:27:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 02:27:56,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:56,202 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:56,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:27:56,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-01-10 02:27:56,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1115196220, now seen corresponding path program 1 times [2025-01-10 02:27:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:56,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053704491] [2025-01-10 02:27:56,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:56,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 02:27:56,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 02:27:56,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:56,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:56,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1345550707] [2025-01-10 02:27:56,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:56,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:56,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:56,223 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:27:56,225 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:27:56,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 02:27:56,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 02:27:56,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:56,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:56,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:27:56,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:56,366 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:27:56,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:27:56,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:56,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053704491] [2025-01-10 02:27:56,367 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:56,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345550707] [2025-01-10 02:27:56,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345550707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:56,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:56,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:27:56,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917822864] [2025-01-10 02:27:56,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:56,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:56,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:56,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:56,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:27:56,368 INFO L87 Difference]: Start difference. First operand 243 states and 246 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:27:56,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:56,841 INFO L93 Difference]: Finished difference Result 417 states and 430 transitions. [2025-01-10 02:27:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:27:56,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2025-01-10 02:27:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:56,843 INFO L225 Difference]: With dead ends: 417 [2025-01-10 02:27:56,843 INFO L226 Difference]: Without dead ends: 352 [2025-01-10 02:27:56,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 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:27:56,844 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 107 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:56,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 158 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 02:27:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-01-10 02:27:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 346. [2025-01-10 02:27:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 260 states have (on average 1.35) internal successors, (351), 336 states have internal predecessors, (351), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:27:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 365 transitions. [2025-01-10 02:27:56,851 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 365 transitions. Word has length 67 [2025-01-10 02:27:56,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:56,851 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 365 transitions. [2025-01-10 02:27:56,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:27:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 365 transitions. [2025-01-10 02:27:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 02:27:56,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:56,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:56,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:27:57,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:57,053 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-01-10 02:27:57,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:57,053 INFO L85 PathProgramCache]: Analyzing trace with hash 856822480, now seen corresponding path program 1 times [2025-01-10 02:27:57,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:57,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363119965] [2025-01-10 02:27:57,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:57,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:57,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 02:27:57,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 02:27:57,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:57,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:57,125 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:27:57,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:57,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363119965] [2025-01-10 02:27:57,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363119965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:57,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:57,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:27:57,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876434120] [2025-01-10 02:27:57,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:57,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:57,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:57,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:57,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:27:57,127 INFO L87 Difference]: Start difference. First operand 346 states and 365 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:27:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:57,364 INFO L93 Difference]: Finished difference Result 347 states and 365 transitions. [2025-01-10 02:27:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:27:57,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 74 [2025-01-10 02:27:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:57,365 INFO L225 Difference]: With dead ends: 347 [2025-01-10 02:27:57,366 INFO L226 Difference]: Without dead ends: 346 [2025-01-10 02:27:57,366 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:27:57,366 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 53 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:57,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 338 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:27:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-01-10 02:27:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-01-10 02:27:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 260 states have (on average 1.3461538461538463) internal successors, (350), 336 states have internal predecessors, (350), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:27:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 364 transitions. [2025-01-10 02:27:57,373 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 364 transitions. Word has length 74 [2025-01-10 02:27:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:57,374 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 364 transitions. [2025-01-10 02:27:57,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:27:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 364 transitions. [2025-01-10 02:27:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-10 02:27:57,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:57,375 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:57,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:27:57,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-01-10 02:27:57,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:57,375 INFO L85 PathProgramCache]: Analyzing trace with hash 791693260, now seen corresponding path program 1 times [2025-01-10 02:27:57,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:57,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338344809] [2025-01-10 02:27:57,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:57,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:57,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 02:27:57,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 02:27:57,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:57,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:57,449 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:27:57,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:57,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338344809] [2025-01-10 02:27:57,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338344809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:57,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:57,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:27:57,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619711968] [2025-01-10 02:27:57,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:57,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:57,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:57,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:27:57,450 INFO L87 Difference]: Start difference. First operand 346 states and 364 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:27:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:57,699 INFO L93 Difference]: Finished difference Result 347 states and 364 transitions. [2025-01-10 02:27:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:27:57,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 75 [2025-01-10 02:27:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:57,702 INFO L225 Difference]: With dead ends: 347 [2025-01-10 02:27:57,702 INFO L226 Difference]: Without dead ends: 346 [2025-01-10 02:27:57,702 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:27:57,702 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 46 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:57,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 347 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:27:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-01-10 02:27:57,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-01-10 02:27:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 336 states have internal predecessors, (349), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:27:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 363 transitions. [2025-01-10 02:27:57,712 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 363 transitions. Word has length 75 [2025-01-10 02:27:57,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:57,712 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 363 transitions. [2025-01-10 02:27:57,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:27:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 363 transitions. [2025-01-10 02:27:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-10 02:27:57,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:57,716 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:57,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:27:57,716 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-01-10 02:27:57,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:57,717 INFO L85 PathProgramCache]: Analyzing trace with hash -858867518, now seen corresponding path program 1 times [2025-01-10 02:27:57,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:57,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315538716] [2025-01-10 02:27:57,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:57,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-10 02:27:57,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-10 02:27:57,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:57,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:57,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434202644] [2025-01-10 02:27:57,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:57,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:57,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:57,753 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:27:57,755 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:27:57,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-10 02:27:57,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-10 02:27:57,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:57,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:57,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:27:57,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:58,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:58,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:58,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315538716] [2025-01-10 02:27:58,246 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:58,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434202644] [2025-01-10 02:27:58,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434202644] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:27:58,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:27:58,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-01-10 02:27:58,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508326789] [2025-01-10 02:27:58,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:58,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:27:58,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:58,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:27:58,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:27:58,247 INFO L87 Difference]: Start difference. First operand 346 states and 363 transitions. Second operand has 8 states, 7 states have (on average 28.857142857142858) internal successors, (202), 8 states have internal predecessors, (202), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:27:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:59,154 INFO L93 Difference]: Finished difference Result 370 states and 381 transitions. [2025-01-10 02:27:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:27:59,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 28.857142857142858) internal successors, (202), 8 states have internal predecessors, (202), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 114 [2025-01-10 02:27:59,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:59,156 INFO L225 Difference]: With dead ends: 370 [2025-01-10 02:27:59,156 INFO L226 Difference]: Without dead ends: 361 [2025-01-10 02:27:59,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:27:59,156 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 387 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:59,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 151 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 02:27:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-01-10 02:27:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 350. [2025-01-10 02:27:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 267 states have (on average 1.3108614232209739) internal successors, (350), 340 states have internal predecessors, (350), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:27:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 364 transitions. [2025-01-10 02:27:59,164 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 364 transitions. Word has length 114 [2025-01-10 02:27:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:59,164 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 364 transitions. [2025-01-10 02:27:59,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 28.857142857142858) internal successors, (202), 8 states have internal predecessors, (202), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:27:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 364 transitions. [2025-01-10 02:27:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-10 02:27:59,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:59,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:59,171 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:27:59,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:59,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-01-10 02:27:59,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:59,370 INFO L85 PathProgramCache]: Analyzing trace with hash -737960188, now seen corresponding path program 1 times [2025-01-10 02:27:59,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:59,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344991207] [2025-01-10 02:27:59,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:59,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:59,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-10 02:27:59,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-10 02:27:59,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:59,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:59,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [214559587] [2025-01-10 02:27:59,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:59,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:59,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:59,391 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:27:59,393 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:27:59,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-10 02:27:59,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-10 02:27:59,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:59,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:59,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 02:27:59,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:59,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:28:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:28:00,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:00,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344991207] [2025-01-10 02:28:00,631 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:28:00,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214559587] [2025-01-10 02:28:00,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214559587] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:28:00,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:28:00,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-01-10 02:28:00,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373561841] [2025-01-10 02:28:00,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:28:00,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:28:00,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:00,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:28:00,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:28:00,633 INFO L87 Difference]: Start difference. First operand 350 states and 364 transitions. Second operand has 9 states, 8 states have (on average 25.75) internal successors, (206), 9 states have internal predecessors, (206), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:28:08,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:28:12,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:28:23,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:28:30,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:28:35,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:28:38,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:28:44,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:28:45,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:28:48,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:28:53,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:28:56,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:29:00,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:29:09,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:29:12,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:29:18,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:29:30,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:29:34,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:29:39,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []