./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound5.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/prodbin-ll_unwindbound5.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 fe22a831ab045bcc67da4505e3ba36b6f549cf1239b349bc9f8fd22458d7fbac --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:19:56,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:19:56,657 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:19:56,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:19:56,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:19:56,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:19:56,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:19:56,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:19:56,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:19:56,676 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:19:56,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:19:56,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:19:56,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:19:56,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:19:56,677 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:19:56,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:19:56,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:19:56,677 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:19:56,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:19:56,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:19:56,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:19:56,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:19:56,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:19:56,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:19:56,678 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:19:56,678 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:19:56,678 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:19:56,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:19:56,678 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:19:56,678 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:19:56,678 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:19:56,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:19:56,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:19:56,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:19:56,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:19:56,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:19:56,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:19:56,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:19:56,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:19:56,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:19:56,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:19:56,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:19:56,679 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:19:56,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:19:56,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:19:56,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:19:56,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:19:56,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:19:56,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:19:56,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:19:56,680 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 -> fe22a831ab045bcc67da4505e3ba36b6f549cf1239b349bc9f8fd22458d7fbac [2025-01-10 02:19:56,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:19:56,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:19:56,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:19:56,905 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:19:56,905 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:19:56,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound5.c [2025-01-10 02:19:58,017 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/965fb687a/2217068c1f8646ae984a65bb8af17d53/FLAG66cb70852 [2025-01-10 02:19:58,255 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:19:58,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound5.c [2025-01-10 02:19:58,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/965fb687a/2217068c1f8646ae984a65bb8af17d53/FLAG66cb70852 [2025-01-10 02:19:58,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/965fb687a/2217068c1f8646ae984a65bb8af17d53 [2025-01-10 02:19:58,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:19:58,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:19:58,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:19:58,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:19:58,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:19:58,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:19:58" (1/1) ... [2025-01-10 02:19:58,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f2d7d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58, skipping insertion in model container [2025-01-10 02:19:58,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:19:58" (1/1) ... [2025-01-10 02:19:58,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:19:58,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:19:58,724 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:19:58,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:19:58,747 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:19:58,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58 WrapperNode [2025-01-10 02:19:58,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:19:58,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:19:58,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:19:58,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:19:58,754 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:19:58" (1/1) ... [2025-01-10 02:19:58,758 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:19:58" (1/1) ... [2025-01-10 02:19:58,768 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2025-01-10 02:19:58,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:19:58,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:19:58,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:19:58,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:19:58,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58" (1/1) ... [2025-01-10 02:19:58,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58" (1/1) ... [2025-01-10 02:19:58,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58" (1/1) ... [2025-01-10 02:19:58,789 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:19:58,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58" (1/1) ... [2025-01-10 02:19:58,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58" (1/1) ... [2025-01-10 02:19:58,795 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58" (1/1) ... [2025-01-10 02:19:58,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58" (1/1) ... [2025-01-10 02:19:58,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58" (1/1) ... [2025-01-10 02:19:58,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58" (1/1) ... [2025-01-10 02:19:58,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58" (1/1) ... [2025-01-10 02:19:58,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:19:58,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:19:58,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:19:58,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:19:58,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58" (1/1) ... [2025-01-10 02:19:58,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:19:58,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:19:58,837 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:19:58,840 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:19:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:19:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:19:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:19:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:19:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:19:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:19:58,902 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:19:58,903 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:19:59,039 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-10 02:19:59,040 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:19:59,048 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:19:59,048 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:19:59,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:19:59 BoogieIcfgContainer [2025-01-10 02:19:59,048 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:19:59,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:19:59,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:19:59,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:19:59,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:19:58" (1/3) ... [2025-01-10 02:19:59,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6024119a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:19:59, skipping insertion in model container [2025-01-10 02:19:59,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:19:58" (2/3) ... [2025-01-10 02:19:59,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6024119a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:19:59, skipping insertion in model container [2025-01-10 02:19:59,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:19:59" (3/3) ... [2025-01-10 02:19:59,054 INFO L128 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound5.c [2025-01-10 02:19:59,064 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:19:59,065 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prodbin-ll_unwindbound5.c that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 18 error locations. [2025-01-10 02:19:59,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:19:59,110 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;@124ce6bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:19:59,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-10 02:19:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:19:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:19:59,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:19:59,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:19:59,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:19:59,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:19:59,120 INFO L85 PathProgramCache]: Analyzing trace with hash 889510409, now seen corresponding path program 1 times [2025-01-10 02:19:59,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:19:59,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615202998] [2025-01-10 02:19:59,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:19:59,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:19:59,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:19:59,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:19:59,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:19:59,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:19:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:19:59,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:19:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615202998] [2025-01-10 02:19:59,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615202998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:19:59,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:19:59,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:19:59,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327379664] [2025-01-10 02:19:59,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:19:59,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:19:59,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:19:59,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:19:59,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:19:59,222 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:19:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:19:59,240 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2025-01-10 02:19:59,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:19:59,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 02:19:59,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:19:59,246 INFO L225 Difference]: With dead ends: 108 [2025-01-10 02:19:59,246 INFO L226 Difference]: Without dead ends: 49 [2025-01-10 02:19:59,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:19:59,252 INFO L435 NwaCegarLoop]: 58 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, 58 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:19:59,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:19:59,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-10 02:19:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-10 02:19:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 46 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:19:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2025-01-10 02:19:59,283 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 6 [2025-01-10 02:19:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:19:59,284 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2025-01-10 02:19:59,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:19:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2025-01-10 02:19:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:19:59,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:19:59,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:19:59,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:19:59,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:19:59,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:19:59,287 INFO L85 PathProgramCache]: Analyzing trace with hash 889568326, now seen corresponding path program 1 times [2025-01-10 02:19:59,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:19:59,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929335001] [2025-01-10 02:19:59,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:19:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:19:59,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:19:59,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:19:59,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:19:59,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:19:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:19:59,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:19:59,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929335001] [2025-01-10 02:19:59,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929335001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:19:59,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:19:59,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:19:59,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084451190] [2025-01-10 02:19:59,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:19:59,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:19:59,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:19:59,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:19:59,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:19:59,386 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:19:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:19:59,424 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-01-10 02:19:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:19:59,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 02:19:59,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:19:59,425 INFO L225 Difference]: With dead ends: 49 [2025-01-10 02:19:59,425 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 02:19:59,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:19:59,426 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 87 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:19:59,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 87 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:19:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 02:19:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-10 02:19:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 45 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:19:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-01-10 02:19:59,430 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 6 [2025-01-10 02:19:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:19:59,430 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-01-10 02:19:59,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:19:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-01-10 02:19:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 02:19:59,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:19:59,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:19:59,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:19:59,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:19:59,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:19:59,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1806814377, now seen corresponding path program 1 times [2025-01-10 02:19:59,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:19:59,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138831091] [2025-01-10 02:19:59,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:19:59,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:19:59,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:19:59,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:19:59,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:19:59,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:19:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:19:59,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:19:59,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138831091] [2025-01-10 02:19:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138831091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:19:59,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:19:59,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:19:59,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129586813] [2025-01-10 02:19:59,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:19:59,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:19:59,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:19:59,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:19:59,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:19:59,486 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:19:59,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:19:59,513 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2025-01-10 02:19:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:19:59,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 02:19:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:19:59,514 INFO L225 Difference]: With dead ends: 57 [2025-01-10 02:19:59,514 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 02:19:59,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:19:59,515 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:19:59,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 132 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:19:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 02:19:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-10 02:19:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 49 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:19:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2025-01-10 02:19:59,519 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 7 [2025-01-10 02:19:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:19:59,519 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2025-01-10 02:19:59,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:19:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2025-01-10 02:19:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:19:59,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:19:59,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:19:59,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:19:59,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:19:59,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:19:59,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1181830318, now seen corresponding path program 1 times [2025-01-10 02:19:59,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:19:59,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767580371] [2025-01-10 02:19:59,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:19:59,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:19:59,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:19:59,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:19:59,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:19:59,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:19:59,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1104176113] [2025-01-10 02:19:59,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:19:59,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:19:59,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:19:59,547 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:19:59,548 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:19:59,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:19:59,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:19:59,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:19:59,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:19:59,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 02:19:59,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:19:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:19:59,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:19:59,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:19:59,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767580371] [2025-01-10 02:19:59,718 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:19:59,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104176113] [2025-01-10 02:19:59,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104176113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:19:59,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:19:59,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:19:59,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179140571] [2025-01-10 02:19:59,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:19:59,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:19:59,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:19:59,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:19:59,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:19:59,720 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:19:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:19:59,843 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2025-01-10 02:19:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:19:59,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 02:19:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:19:59,844 INFO L225 Difference]: With dead ends: 75 [2025-01-10 02:19:59,844 INFO L226 Difference]: Without dead ends: 66 [2025-01-10 02:19:59,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:19:59,845 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 77 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:19:59,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 59 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:19:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-10 02:19:59,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2025-01-10 02:19:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 60 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:19:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2025-01-10 02:19:59,851 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 9 [2025-01-10 02:19:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:19:59,852 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2025-01-10 02:19:59,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:19:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2025-01-10 02:19:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 02:19:59,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:19:59,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:19:59,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 02:20:00,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:00,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:00,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:00,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2017965749, now seen corresponding path program 1 times [2025-01-10 02:20:00,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:00,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991055804] [2025-01-10 02:20:00,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:00,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:00,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 02:20:00,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 02:20:00,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:00,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:20:00,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507133351] [2025-01-10 02:20:00,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:00,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:00,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:20:00,074 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:20:00,075 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:20:00,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 02:20:00,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 02:20:00,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:00,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:00,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 02:20:00,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:20:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:00,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:20:00,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:00,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991055804] [2025-01-10 02:20:00,200 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:20:00,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507133351] [2025-01-10 02:20:00,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507133351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:00,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:00,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:20:00,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840809285] [2025-01-10 02:20:00,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:00,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:20:00,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:00,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:20:00,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:20:00,204 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:20:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:00,314 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2025-01-10 02:20:00,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:20:00,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 02:20:00,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:00,316 INFO L225 Difference]: With dead ends: 67 [2025-01-10 02:20:00,319 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 02:20:00,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:20:00,320 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 73 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:00,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 63 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:20:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 02:20:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-10 02:20:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:20:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2025-01-10 02:20:00,327 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 10 [2025-01-10 02:20:00,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:00,327 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2025-01-10 02:20:00,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:20:00,327 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2025-01-10 02:20:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 02:20:00,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:00,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:00,334 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:20:00,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:00,532 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:00,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:00,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1867571280, now seen corresponding path program 1 times [2025-01-10 02:20:00,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:00,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379226640] [2025-01-10 02:20:00,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:00,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:00,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 02:20:00,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 02:20:00,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:00,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:00,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:00,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379226640] [2025-01-10 02:20:00,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379226640] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:00,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:00,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:20:00,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963847850] [2025-01-10 02:20:00,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:00,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:20:00,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:00,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:20:00,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:20:00,607 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:20:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:00,676 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2025-01-10 02:20:00,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:20:00,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 02:20:00,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:00,677 INFO L225 Difference]: With dead ends: 88 [2025-01-10 02:20:00,677 INFO L226 Difference]: Without dead ends: 87 [2025-01-10 02:20:00,677 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:20:00,678 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:00,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:20:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-10 02:20:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2025-01-10 02:20:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 73 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:20:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2025-01-10 02:20:00,686 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 11 [2025-01-10 02:20:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:00,686 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2025-01-10 02:20:00,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:20:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2025-01-10 02:20:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 02:20:00,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:00,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:00,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:20:00,686 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:00,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:00,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2060134893, now seen corresponding path program 1 times [2025-01-10 02:20:00,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:00,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224878919] [2025-01-10 02:20:00,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:00,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:00,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 02:20:00,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 02:20:00,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:00,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:00,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:00,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224878919] [2025-01-10 02:20:00,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224878919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:00,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:00,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:20:00,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380906753] [2025-01-10 02:20:00,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:00,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:20:00,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:00,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:20:00,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:20:00,772 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:20:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:00,846 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2025-01-10 02:20:00,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:20:00,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 02:20:00,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:00,847 INFO L225 Difference]: With dead ends: 88 [2025-01-10 02:20:00,848 INFO L226 Difference]: Without dead ends: 87 [2025-01-10 02:20:00,848 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:20:00,848 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:00,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 79 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:20:00,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-10 02:20:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2025-01-10 02:20:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 73 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:20:00,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2025-01-10 02:20:00,854 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 12 [2025-01-10 02:20:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:00,854 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-01-10 02:20:00,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:20:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2025-01-10 02:20:00,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 02:20:00,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:00,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:00,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:20:00,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:00,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1998791529, now seen corresponding path program 1 times [2025-01-10 02:20:00,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:00,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083282169] [2025-01-10 02:20:00,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:00,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:00,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 02:20:00,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 02:20:00,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:00,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:00,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:00,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083282169] [2025-01-10 02:20:00,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083282169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:00,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:00,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:20:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058388043] [2025-01-10 02:20:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:00,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:20:00,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:00,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:20:00,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:20:00,942 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:00,984 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2025-01-10 02:20:00,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:20:00,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-10 02:20:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:00,985 INFO L225 Difference]: With dead ends: 79 [2025-01-10 02:20:00,985 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 02:20:00,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:20:00,986 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 56 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:00,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 59 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:20:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 02:20:00,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-10 02:20:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 73 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:20:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2025-01-10 02:20:00,993 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 22 [2025-01-10 02:20:00,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:00,993 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2025-01-10 02:20:00,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:00,993 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2025-01-10 02:20:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 02:20:00,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:00,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:00,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:20:00,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:00,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1832995177, now seen corresponding path program 1 times [2025-01-10 02:20:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:00,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863627796] [2025-01-10 02:20:00,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:00,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 02:20:01,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 02:20:01,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:01,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:01,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:01,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:01,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863627796] [2025-01-10 02:20:01,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863627796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:01,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:01,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:20:01,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85988171] [2025-01-10 02:20:01,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:01,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:20:01,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:01,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:20:01,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:20:01,057 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:01,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:01,094 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2025-01-10 02:20:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:20:01,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-10 02:20:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:01,095 INFO L225 Difference]: With dead ends: 79 [2025-01-10 02:20:01,095 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 02:20:01,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:20:01,096 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:01,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 60 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:20:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 02:20:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-10 02:20:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 73 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:20:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2025-01-10 02:20:01,105 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 23 [2025-01-10 02:20:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:01,105 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2025-01-10 02:20:01,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2025-01-10 02:20:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 02:20:01,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:01,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:01,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:20:01,107 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:01,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:01,107 INFO L85 PathProgramCache]: Analyzing trace with hash -987966726, now seen corresponding path program 1 times [2025-01-10 02:20:01,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:01,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531730735] [2025-01-10 02:20:01,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:01,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:01,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:20:01,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:20:01,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:01,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:01,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:01,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531730735] [2025-01-10 02:20:01,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531730735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:01,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:01,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:20:01,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861977953] [2025-01-10 02:20:01,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:01,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:20:01,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:01,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:20:01,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:20:01,174 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:01,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:01,226 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-01-10 02:20:01,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:20:01,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-01-10 02:20:01,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:01,227 INFO L225 Difference]: With dead ends: 82 [2025-01-10 02:20:01,227 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 02:20:01,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:20:01,228 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 65 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:01,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 47 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:20:01,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 02:20:01,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2025-01-10 02:20:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 72 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:20:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2025-01-10 02:20:01,239 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 24 [2025-01-10 02:20:01,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:01,239 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2025-01-10 02:20:01,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2025-01-10 02:20:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:20:01,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:01,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:01,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:20:01,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:01,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash -562197341, now seen corresponding path program 1 times [2025-01-10 02:20:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:01,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165301610] [2025-01-10 02:20:01,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:01,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:01,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:20:01,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:20:01,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:01,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:01,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:01,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165301610] [2025-01-10 02:20:01,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165301610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:01,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:01,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:20:01,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890563148] [2025-01-10 02:20:01,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:01,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:20:01,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:01,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:20:01,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:20:01,325 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:01,358 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2025-01-10 02:20:01,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:20:01,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-10 02:20:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:01,359 INFO L225 Difference]: With dead ends: 77 [2025-01-10 02:20:01,359 INFO L226 Difference]: Without dead ends: 75 [2025-01-10 02:20:01,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:20:01,359 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 51 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:01,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 32 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:20:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-10 02:20:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-01-10 02:20:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.305084745762712) internal successors, (77), 68 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:20:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2025-01-10 02:20:01,367 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 25 [2025-01-10 02:20:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:01,367 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2025-01-10 02:20:01,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2025-01-10 02:20:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 02:20:01,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:01,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:01,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 02:20:01,368 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:01,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:01,369 INFO L85 PathProgramCache]: Analyzing trace with hash -545037154, now seen corresponding path program 1 times [2025-01-10 02:20:01,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:01,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340143135] [2025-01-10 02:20:01,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:01,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:01,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:20:01,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:20:01,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:01,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:01,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:01,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340143135] [2025-01-10 02:20:01,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340143135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:01,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:01,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:20:01,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725418971] [2025-01-10 02:20:01,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:01,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:20:01,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:01,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:20:01,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:20:01,408 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:01,458 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2025-01-10 02:20:01,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:20:01,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-01-10 02:20:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:01,459 INFO L225 Difference]: With dead ends: 78 [2025-01-10 02:20:01,459 INFO L226 Difference]: Without dead ends: 77 [2025-01-10 02:20:01,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:20:01,460 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 54 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:01,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 53 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:20:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-10 02:20:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2025-01-10 02:20:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 71 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:20:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2025-01-10 02:20:01,468 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 26 [2025-01-10 02:20:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:01,468 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2025-01-10 02:20:01,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2025-01-10 02:20:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 02:20:01,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:01,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:01,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 02:20:01,470 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:01,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:01,470 INFO L85 PathProgramCache]: Analyzing trace with hash 283717499, now seen corresponding path program 1 times [2025-01-10 02:20:01,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:01,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568952979] [2025-01-10 02:20:01,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:01,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:01,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 02:20:01,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 02:20:01,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:01,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:01,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:01,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568952979] [2025-01-10 02:20:01,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568952979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:01,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:01,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:20:01,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363471639] [2025-01-10 02:20:01,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:01,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:20:01,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:01,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:20:01,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:20:01,529 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:01,568 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2025-01-10 02:20:01,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:20:01,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-10 02:20:01,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:01,569 INFO L225 Difference]: With dead ends: 78 [2025-01-10 02:20:01,569 INFO L226 Difference]: Without dead ends: 77 [2025-01-10 02:20:01,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:20:01,570 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 52 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:01,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 54 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:20:01,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-10 02:20:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-10 02:20:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 72 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:20:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2025-01-10 02:20:01,576 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 27 [2025-01-10 02:20:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:01,577 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2025-01-10 02:20:01,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2025-01-10 02:20:01,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 02:20:01,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:01,578 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:01,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 02:20:01,578 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:01,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:01,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1951511434, now seen corresponding path program 1 times [2025-01-10 02:20:01,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:01,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757146965] [2025-01-10 02:20:01,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:01,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:01,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:20:01,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:20:01,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:01,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:01,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:01,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757146965] [2025-01-10 02:20:01,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757146965] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:20:01,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582703946] [2025-01-10 02:20:01,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:01,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:01,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:20:01,637 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:20:01,638 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:20:01,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:20:01,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:20:01,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:01,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:01,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:20:01,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:20:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:01,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:20:01,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582703946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:01,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:20:01,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 02:20:01,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451999072] [2025-01-10 02:20:01,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:01,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:20:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:01,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:20:01,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:20:01,712 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:01,738 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2025-01-10 02:20:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:20:01,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-01-10 02:20:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:01,739 INFO L225 Difference]: With dead ends: 77 [2025-01-10 02:20:01,739 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 02:20:01,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:20:01,739 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 21 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:01,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 100 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:20:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 02:20:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-10 02:20:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.253968253968254) internal successors, (79), 71 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:20:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2025-01-10 02:20:01,743 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 28 [2025-01-10 02:20:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:01,743 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2025-01-10 02:20:01,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2025-01-10 02:20:01,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 02:20:01,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:01,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:01,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:20:01,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:01,948 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:01,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash 205307968, now seen corresponding path program 1 times [2025-01-10 02:20:01,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:01,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267526260] [2025-01-10 02:20:01,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:01,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:01,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:20:01,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:20:01,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:01,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:01,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:01,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267526260] [2025-01-10 02:20:01,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267526260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:01,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:01,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:20:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460572282] [2025-01-10 02:20:01,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:01,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:20:01,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:01,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:20:01,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:20:01,995 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:02,034 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-01-10 02:20:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:20:02,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-01-10 02:20:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:02,035 INFO L225 Difference]: With dead ends: 82 [2025-01-10 02:20:02,035 INFO L226 Difference]: Without dead ends: 81 [2025-01-10 02:20:02,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:20:02,036 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:02,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 41 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:20:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-10 02:20:02,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2025-01-10 02:20:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 70 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:20:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2025-01-10 02:20:02,040 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 28 [2025-01-10 02:20:02,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:02,040 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2025-01-10 02:20:02,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:02,040 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2025-01-10 02:20:02,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 02:20:02,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:02,041 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:20:02,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:20:02,041 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:02,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:02,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1498218673, now seen corresponding path program 1 times [2025-01-10 02:20:02,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:02,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420455584] [2025-01-10 02:20:02,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:02,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:02,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:20:02,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:20:02,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:02,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:20:02,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610548210] [2025-01-10 02:20:02,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:02,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:02,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:20:02,058 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:20:02,060 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:20:02,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:20:02,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:20:02,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:02,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:02,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:20:02,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:20:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:02,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:20:02,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:02,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420455584] [2025-01-10 02:20:02,460 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:20:02,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610548210] [2025-01-10 02:20:02,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610548210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:02,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:02,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 02:20:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530984530] [2025-01-10 02:20:02,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:02,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:20:02,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:02,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:20:02,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:20:02,462 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:02,759 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-01-10 02:20:02,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:20:02,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-01-10 02:20:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:02,760 INFO L225 Difference]: With dead ends: 82 [2025-01-10 02:20:02,760 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 02:20:02,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:20:02,761 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 85 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:02,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 76 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:20:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 02:20:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2025-01-10 02:20:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:20:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2025-01-10 02:20:02,766 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2025-01-10 02:20:02,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:02,766 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2025-01-10 02:20:02,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2025-01-10 02:20:02,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 02:20:02,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:02,766 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:02,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 02:20:02,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 02:20:02,971 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:02,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash 799861450, now seen corresponding path program 1 times [2025-01-10 02:20:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:02,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055859178] [2025-01-10 02:20:02,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:02,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:02,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 02:20:02,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 02:20:02,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:02,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:20:02,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [134192951] [2025-01-10 02:20:02,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:02,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:02,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:20:02,987 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:20:02,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 02:20:03,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 02:20:03,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 02:20:03,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:03,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:03,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:20:03,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:20:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:03,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:20:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055859178] [2025-01-10 02:20:03,360 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:20:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134192951] [2025-01-10 02:20:03,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134192951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:03,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:03,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 02:20:03,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702634327] [2025-01-10 02:20:03,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:03,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:20:03,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:03,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:20:03,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:20:03,361 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:05,396 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2025-01-10 02:20:05,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:20:05,397 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-01-10 02:20:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:05,397 INFO L225 Difference]: With dead ends: 81 [2025-01-10 02:20:05,397 INFO L226 Difference]: Without dead ends: 79 [2025-01-10 02:20:05,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:20:05,398 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 77 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:05,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 100 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:20:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-10 02:20:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2025-01-10 02:20:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.180327868852459) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:20:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2025-01-10 02:20:05,404 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 31 [2025-01-10 02:20:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:05,404 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2025-01-10 02:20:05,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2025-01-10 02:20:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 02:20:05,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:05,405 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:20:05,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:20:05,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 02:20:05,606 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:05,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:05,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1986093077, now seen corresponding path program 1 times [2025-01-10 02:20:05,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:05,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784488468] [2025-01-10 02:20:05,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:05,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:05,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 02:20:05,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 02:20:05,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:05,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:20:05,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [842167906] [2025-01-10 02:20:05,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:05,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:05,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:20:05,621 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:20:05,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 02:20:05,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 02:20:05,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 02:20:05,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:05,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:05,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 02:20:05,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:20:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:08,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:20:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:09,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:09,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784488468] [2025-01-10 02:20:09,586 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:20:09,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842167906] [2025-01-10 02:20:09,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842167906] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 02:20:09,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:20:09,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2025-01-10 02:20:09,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648661428] [2025-01-10 02:20:09,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:09,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:20:09,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:09,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:20:09,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:20:09,587 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:09,898 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2025-01-10 02:20:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:20:09,898 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-01-10 02:20:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:09,899 INFO L225 Difference]: With dead ends: 75 [2025-01-10 02:20:09,899 INFO L226 Difference]: Without dead ends: 74 [2025-01-10 02:20:09,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:20:09,900 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:09,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 51 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:20:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-10 02:20:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-01-10 02:20:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 67 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:20:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-01-10 02:20:09,904 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 34 [2025-01-10 02:20:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:09,904 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-01-10 02:20:09,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:09,904 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-01-10 02:20:09,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 02:20:09,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:09,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:09,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 02:20:10,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:20:10,106 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:10,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1439343300, now seen corresponding path program 1 times [2025-01-10 02:20:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:10,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717075754] [2025-01-10 02:20:10,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:10,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:10,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 02:20:10,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 02:20:10,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:10,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:20:10,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666647062] [2025-01-10 02:20:10,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:10,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:10,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:20:10,121 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:20:10,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 02:20:10,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 02:20:10,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 02:20:10,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:10,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:10,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:20:10,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:20:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:11,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:20:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:12,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:12,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717075754] [2025-01-10 02:20:12,696 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:20:12,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666647062] [2025-01-10 02:20:12,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666647062] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:20:12,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:20:12,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2025-01-10 02:20:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64522573] [2025-01-10 02:20:12,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:20:12,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 02:20:12,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:12,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 02:20:12,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:20:12,697 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:20:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:14,218 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2025-01-10 02:20:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 02:20:14,218 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-01-10 02:20:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:14,219 INFO L225 Difference]: With dead ends: 104 [2025-01-10 02:20:14,219 INFO L226 Difference]: Without dead ends: 102 [2025-01-10 02:20:14,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2025-01-10 02:20:14,219 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:14,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 114 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 02:20:14,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-10 02:20:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2025-01-10 02:20:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 84 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:20:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2025-01-10 02:20:14,224 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 35 [2025-01-10 02:20:14,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:14,224 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2025-01-10 02:20:14,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:20:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2025-01-10 02:20:14,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 02:20:14,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:14,224 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:14,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 02:20:14,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:14,425 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:14,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1669969399, now seen corresponding path program 1 times [2025-01-10 02:20:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:14,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008174973] [2025-01-10 02:20:14,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:14,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:14,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:20:14,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:20:14,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:14,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:20:14,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151140927] [2025-01-10 02:20:14,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:14,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:14,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:20:14,436 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:20:14,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 02:20:14,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:20:14,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:20:14,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:14,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:14,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:20:14,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:20:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:14,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:20:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:15,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:15,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008174973] [2025-01-10 02:20:15,918 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:20:15,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151140927] [2025-01-10 02:20:15,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151140927] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 02:20:15,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:20:15,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2025-01-10 02:20:15,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699140878] [2025-01-10 02:20:15,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:15,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:20:15,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:15,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:20:15,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:20:15,920 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:18,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:20:20,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:20,395 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2025-01-10 02:20:20,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:20:20,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-01-10 02:20:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:20,396 INFO L225 Difference]: With dead ends: 91 [2025-01-10 02:20:20,396 INFO L226 Difference]: Without dead ends: 90 [2025-01-10 02:20:20,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:20:20,396 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:20,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 109 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-10 02:20:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-10 02:20:20,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-10 02:20:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 84 states have internal predecessors, (93), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:20:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2025-01-10 02:20:20,404 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 36 [2025-01-10 02:20:20,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:20,404 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2025-01-10 02:20:20,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2025-01-10 02:20:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 02:20:20,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:20,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:20:20,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 02:20:20,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:20,606 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:20,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:20,606 INFO L85 PathProgramCache]: Analyzing trace with hash 229443878, now seen corresponding path program 1 times [2025-01-10 02:20:20,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:20,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110321968] [2025-01-10 02:20:20,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:20,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:20,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:20:20,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:20:20,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:20,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:20:20,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385000432] [2025-01-10 02:20:20,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:20,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:20,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:20:20,622 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:20:20,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 02:20:20,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:20:20,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:20:20,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:20,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:20,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:20:20,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:20:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:20,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:20:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:20:22,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:22,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110321968] [2025-01-10 02:20:22,763 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:20:22,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385000432] [2025-01-10 02:20:22,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385000432] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 02:20:22,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:20:22,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2025-01-10 02:20:22,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180920378] [2025-01-10 02:20:22,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:22,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:20:22,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:22,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:20:22,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:20:22,764 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:25,493 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2025-01-10 02:20:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:20:25,494 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-01-10 02:20:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:25,494 INFO L225 Difference]: With dead ends: 91 [2025-01-10 02:20:25,494 INFO L226 Difference]: Without dead ends: 90 [2025-01-10 02:20:25,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-01-10 02:20:25,495 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:25,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 02:20:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-10 02:20:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-10 02:20:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 84 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:20:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2025-01-10 02:20:25,500 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 37 [2025-01-10 02:20:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:25,500 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2025-01-10 02:20:25,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:20:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2025-01-10 02:20:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 02:20:25,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:25,501 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:20:25,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 02:20:25,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:25,705 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:25,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:25,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1662503018, now seen corresponding path program 1 times [2025-01-10 02:20:25,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:25,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627315461] [2025-01-10 02:20:25,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:25,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:25,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:20:25,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:20:25,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:25,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:25,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:25,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627315461] [2025-01-10 02:20:25,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627315461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:25,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:25,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:20:25,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626530937] [2025-01-10 02:20:25,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:25,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:20:25,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:25,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:20:25,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:20:25,761 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:20:25,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:25,797 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2025-01-10 02:20:25,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:20:25,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-01-10 02:20:25,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:25,798 INFO L225 Difference]: With dead ends: 94 [2025-01-10 02:20:25,800 INFO L226 Difference]: Without dead ends: 93 [2025-01-10 02:20:25,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:20:25,801 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:25,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 100 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:20:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-10 02:20:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2025-01-10 02:20:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.1625) internal successors, (93), 85 states have internal predecessors, (93), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:20:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2025-01-10 02:20:25,807 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 43 [2025-01-10 02:20:25,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:25,807 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2025-01-10 02:20:25,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:20:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2025-01-10 02:20:25,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 02:20:25,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:25,808 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:20:25,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 02:20:25,808 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:25,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2014072, now seen corresponding path program 1 times [2025-01-10 02:20:25,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:25,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110449555] [2025-01-10 02:20:25,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:25,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:25,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 02:20:25,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 02:20:25,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:25,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:25,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:25,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110449555] [2025-01-10 02:20:25,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110449555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:20:25,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:20:25,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:20:25,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823646507] [2025-01-10 02:20:25,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:20:25,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:20:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:25,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:20:25,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:20:25,868 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:20:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:25,899 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2025-01-10 02:20:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:20:25,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-01-10 02:20:25,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:25,900 INFO L225 Difference]: With dead ends: 95 [2025-01-10 02:20:25,900 INFO L226 Difference]: Without dead ends: 94 [2025-01-10 02:20:25,900 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:20:25,900 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:25,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:20:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-10 02:20:25,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2025-01-10 02:20:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.1604938271604939) internal successors, (94), 86 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:20:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2025-01-10 02:20:25,906 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 44 [2025-01-10 02:20:25,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:25,906 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2025-01-10 02:20:25,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:20:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2025-01-10 02:20:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 02:20:25,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:25,907 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:20:25,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 02:20:25,907 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:25,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:25,907 INFO L85 PathProgramCache]: Analyzing trace with hash -128243683, now seen corresponding path program 1 times [2025-01-10 02:20:25,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:25,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728670568] [2025-01-10 02:20:25,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:25,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:25,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 02:20:25,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 02:20:25,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:25,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728670568] [2025-01-10 02:20:25,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728670568] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:20:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930161607] [2025-01-10 02:20:25,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:25,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:25,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:20:25,964 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:20:25,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 02:20:25,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 02:20:25,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 02:20:25,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:25,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:25,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:20:25,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:20:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:26,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:20:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:26,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930161607] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:20:26,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:20:26,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 02:20:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999205990] [2025-01-10 02:20:26,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:20:26,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:20:26,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:26,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:20:26,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:20:26,089 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:20:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:26,170 INFO L93 Difference]: Finished difference Result 251 states and 297 transitions. [2025-01-10 02:20:26,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:20:26,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 47 [2025-01-10 02:20:26,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:26,172 INFO L225 Difference]: With dead ends: 251 [2025-01-10 02:20:26,172 INFO L226 Difference]: Without dead ends: 250 [2025-01-10 02:20:26,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:20:26,172 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 137 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:26,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 93 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:20:26,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-10 02:20:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2025-01-10 02:20:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 230 states have (on average 1.1478260869565218) internal successors, (264), 235 states have internal predecessors, (264), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 02:20:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 288 transitions. [2025-01-10 02:20:26,183 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 288 transitions. Word has length 47 [2025-01-10 02:20:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:26,184 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 288 transitions. [2025-01-10 02:20:26,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:20:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 288 transitions. [2025-01-10 02:20:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 02:20:26,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:26,184 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:20:26,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 02:20:26,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 02:20:26,388 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:26,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash 354404496, now seen corresponding path program 1 times [2025-01-10 02:20:26,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:26,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606935029] [2025-01-10 02:20:26,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:26,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:26,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 02:20:26,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 02:20:26,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:26,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:26,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:26,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606935029] [2025-01-10 02:20:26,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606935029] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:20:26,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359105176] [2025-01-10 02:20:26,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:26,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:26,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:20:26,461 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:20:26,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 02:20:26,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 02:20:26,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 02:20:26,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:26,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:26,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:20:26,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:20:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:26,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:20:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359105176] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:20:26,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:20:26,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 02:20:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603276118] [2025-01-10 02:20:26,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:20:26,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 02:20:26,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:26,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 02:20:26,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:20:26,658 INFO L87 Difference]: Start difference. First operand 249 states and 288 transitions. Second operand has 13 states, 12 states have (on average 9.166666666666666) internal successors, (110), 13 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:20:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:26,800 INFO L93 Difference]: Finished difference Result 293 states and 342 transitions. [2025-01-10 02:20:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:20:26,800 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.166666666666666) internal successors, (110), 13 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2025-01-10 02:20:26,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:26,801 INFO L225 Difference]: With dead ends: 293 [2025-01-10 02:20:26,801 INFO L226 Difference]: Without dead ends: 292 [2025-01-10 02:20:26,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:20:26,802 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 145 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:26,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 154 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:20:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-10 02:20:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 286. [2025-01-10 02:20:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 265 states have (on average 1.1433962264150943) internal successors, (303), 270 states have internal predecessors, (303), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-10 02:20:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 331 transitions. [2025-01-10 02:20:26,815 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 331 transitions. Word has length 47 [2025-01-10 02:20:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:26,815 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 331 transitions. [2025-01-10 02:20:26,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.166666666666666) internal successors, (110), 13 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:20:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 331 transitions. [2025-01-10 02:20:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 02:20:26,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:26,816 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:20:26,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 02:20:27,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 02:20:27,016 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:27,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash 319413212, now seen corresponding path program 1 times [2025-01-10 02:20:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:27,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932773907] [2025-01-10 02:20:27,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:27,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 02:20:27,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 02:20:27,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:27,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:27,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:27,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932773907] [2025-01-10 02:20:27,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932773907] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:20:27,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182090157] [2025-01-10 02:20:27,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:27,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:27,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:20:27,055 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:20:27,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 02:20:27,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 02:20:27,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 02:20:27,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:27,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:27,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:20:27,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:20:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:27,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:20:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:27,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182090157] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:20:27,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:20:27,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 02:20:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88372729] [2025-01-10 02:20:27,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:20:27,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:20:27,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:27,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:20:27,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:20:27,170 INFO L87 Difference]: Start difference. First operand 286 states and 331 transitions. Second operand has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:20:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:27,251 INFO L93 Difference]: Finished difference Result 292 states and 338 transitions. [2025-01-10 02:20:27,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:20:27,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2025-01-10 02:20:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:27,252 INFO L225 Difference]: With dead ends: 292 [2025-01-10 02:20:27,252 INFO L226 Difference]: Without dead ends: 291 [2025-01-10 02:20:27,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:20:27,252 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 132 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:27,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:20:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-01-10 02:20:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 276. [2025-01-10 02:20:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 257 states have (on average 1.1245136186770428) internal successors, (289), 262 states have internal predecessors, (289), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 02:20:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 313 transitions. [2025-01-10 02:20:27,266 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 313 transitions. Word has length 48 [2025-01-10 02:20:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:27,266 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 313 transitions. [2025-01-10 02:20:27,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:20:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 313 transitions. [2025-01-10 02:20:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 02:20:27,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:27,267 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:20:27,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 02:20:27,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:27,467 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:27,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1898362434, now seen corresponding path program 1 times [2025-01-10 02:20:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:27,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132919648] [2025-01-10 02:20:27,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:27,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 02:20:27,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 02:20:27,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:27,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:27,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:20:27,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132919648] [2025-01-10 02:20:27,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132919648] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:20:27,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341383634] [2025-01-10 02:20:27,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:27,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:27,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:20:27,557 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:20:27,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 02:20:27,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 02:20:27,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 02:20:27,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:27,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:27,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:20:27,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:20:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:27,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:20:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:20:27,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341383634] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:20:27,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:20:27,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 02:20:27,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669127815] [2025-01-10 02:20:27,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:20:27,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 02:20:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:20:27,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 02:20:27,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:20:27,746 INFO L87 Difference]: Start difference. First operand 276 states and 313 transitions. Second operand has 13 states, 12 states have (on average 9.416666666666666) internal successors, (113), 13 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:20:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:20:27,859 INFO L93 Difference]: Finished difference Result 282 states and 319 transitions. [2025-01-10 02:20:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:20:27,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.416666666666666) internal successors, (113), 13 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2025-01-10 02:20:27,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:20:27,860 INFO L225 Difference]: With dead ends: 282 [2025-01-10 02:20:27,860 INFO L226 Difference]: Without dead ends: 281 [2025-01-10 02:20:27,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:20:27,861 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 155 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:20:27,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 124 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:20:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-10 02:20:27,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 271. [2025-01-10 02:20:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 252 states have (on average 1.1150793650793651) internal successors, (281), 257 states have internal predecessors, (281), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 02:20:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2025-01-10 02:20:27,875 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 48 [2025-01-10 02:20:27,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:20:27,875 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2025-01-10 02:20:27,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.416666666666666) internal successors, (113), 13 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:20:27,875 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2025-01-10 02:20:27,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 02:20:27,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:20:27,876 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-01-10 02:20:27,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 02:20:28,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:28,076 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:20:28,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:20:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash 708540266, now seen corresponding path program 1 times [2025-01-10 02:20:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:20:28,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635701493] [2025-01-10 02:20:28,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:28,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:20:28,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 02:20:28,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 02:20:28,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:28,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:20:28,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693636581] [2025-01-10 02:20:28,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:20:28,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:20:28,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:20:28,092 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:20:28,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 02:20:28,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 02:20:28,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 02:20:28,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:20:28,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:20:28,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 02:20:28,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:20:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:20:28,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:21:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 18 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:21:06,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:21:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635701493] [2025-01-10 02:21:06,445 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:21:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693636581] [2025-01-10 02:21:06,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693636581] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:21:06,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:21:06,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2025-01-10 02:21:06,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230092730] [2025-01-10 02:21:06,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:21:06,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-10 02:21:06,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:21:06,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-10 02:21:06,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=551, Unknown=1, NotChecked=0, Total=702 [2025-01-10 02:21:06,446 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 4 states have call successors, (4), 1 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:21:07,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:21:24,418 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 75 DAG size of output: 67 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-10 02:21:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:21:39,048 INFO L93 Difference]: Finished difference Result 298 states and 334 transitions. [2025-01-10 02:21:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-10 02:21:39,049 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 57 [2025-01-10 02:21:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:21:39,050 INFO L225 Difference]: With dead ends: 298 [2025-01-10 02:21:39,050 INFO L226 Difference]: Without dead ends: 297 [2025-01-10 02:21:39,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 47.3s TimeCoverageRelationStatistics Valid=413, Invalid=1392, Unknown=1, NotChecked=0, Total=1806 [2025-01-10 02:21:39,050 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 92 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-01-10 02:21:39,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 376 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2025-01-10 02:21:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-01-10 02:21:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 287. [2025-01-10 02:21:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 267 states have (on average 1.101123595505618) internal successors, (294), 272 states have internal predecessors, (294), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 02:21:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 320 transitions. [2025-01-10 02:21:39,067 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 320 transitions. Word has length 57 [2025-01-10 02:21:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:21:39,067 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 320 transitions. [2025-01-10 02:21:39,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 4 states have call successors, (4), 1 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:21:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 320 transitions. [2025-01-10 02:21:39,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 02:21:39,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:21:39,067 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:21:39,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 02:21:39,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 02:21:39,268 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 02:21:39,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:21:39,269 INFO L85 PathProgramCache]: Analyzing trace with hash 489911827, now seen corresponding path program 1 times [2025-01-10 02:21:39,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:21:39,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941844883] [2025-01-10 02:21:39,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:21:39,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:21:39,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 02:21:39,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 02:21:39,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:21:39,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:21:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [690194587] [2025-01-10 02:21:39,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:21:39,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:21:39,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:21:39,287 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:21:39,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 02:21:39,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 02:21:39,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 02:21:39,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:21:39,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:21:39,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 02:21:39,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:21:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:21:39,997 INFO L312 TraceCheckSpWp]: Computing backward predicates...