./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.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/bitvector/soft_float_4-2a.c.cil.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:23:38,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:23:38,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:23:38,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:23:38,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:23:38,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:23:38,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:23:38,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:23:38,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:23:38,705 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:23:38,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:23:38,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:23:38,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:23:38,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:23:38,706 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:23:38,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:23:38,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:23:38,706 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:23:38,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:23:38,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:23:38,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:23:38,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:23:38,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:23:38,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:23:38,707 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:23:38,707 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:23:38,707 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:23:38,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:23:38,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:23:38,708 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:23:38,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:23:38,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:23:38,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:23:38,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:23:38,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:38,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:23:38,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:23:38,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:23:38,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:23:38,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:38,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:23:38,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:23:38,709 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:23:38,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:23:38,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:23:38,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:23:38,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:23:38,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:23:38,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:23:38,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:23:38,710 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2025-01-10 01:23:39,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:23:39,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:23:39,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:23:39,051 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:23:39,052 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:23:39,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-01-10 01:23:40,350 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ca15a2b4/91c89a6575c845f1a945d3182b9c3062/FLAG0be5f0829 [2025-01-10 01:23:40,632 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:23:40,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-01-10 01:23:40,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ca15a2b4/91c89a6575c845f1a945d3182b9c3062/FLAG0be5f0829 [2025-01-10 01:23:40,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ca15a2b4/91c89a6575c845f1a945d3182b9c3062 [2025-01-10 01:23:40,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:23:40,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:23:40,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:23:40,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:23:40,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:23:40,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:40,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f22b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40, skipping insertion in model container [2025-01-10 01:23:40,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:40,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:23:40,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:23:40,899 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:23:40,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:23:40,961 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:23:40,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40 WrapperNode [2025-01-10 01:23:40,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:23:40,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:23:40,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:23:40,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:23:40,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:40,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:40,987 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-01-10 01:23:40,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:23:40,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:23:40,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:23:40,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:23:40,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:40,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:40,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:41,008 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 01:23:41,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:41,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:41,013 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:41,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:41,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:41,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:41,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:41,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:23:41,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:23:41,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:23:41,022 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:23:41,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (1/1) ... [2025-01-10 01:23:41,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:41,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:41,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:23:41,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:23:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:23:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:23:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-01-10 01:23:41,077 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-01-10 01:23:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:23:41,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:23:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-01-10 01:23:41,077 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-01-10 01:23:41,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:23:41,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:23:41,145 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:23:41,146 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:23:41,558 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-01-10 01:23:41,558 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:23:41,572 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:23:41,575 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:23:41,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:41 BoogieIcfgContainer [2025-01-10 01:23:41,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:23:41,579 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:23:41,579 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:23:41,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:23:41,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:23:40" (1/3) ... [2025-01-10 01:23:41,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331d8c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:41, skipping insertion in model container [2025-01-10 01:23:41,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:40" (2/3) ... [2025-01-10 01:23:41,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331d8c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:41, skipping insertion in model container [2025-01-10 01:23:41,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:41" (3/3) ... [2025-01-10 01:23:41,585 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2025-01-10 01:23:41,596 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:23:41,598 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-2a.c.cil.c that has 4 procedures, 107 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-01-10 01:23:41,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:23:41,652 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;@3509cc2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:23:41,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 01:23:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 95 states have internal predecessors, (125), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:23:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:23:41,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:41,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:41,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:41,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1925537331, now seen corresponding path program 1 times [2025-01-10 01:23:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:41,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703713666] [2025-01-10 01:23:41,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:41,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:41,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:23:41,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:23:41,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:41,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:41,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:41,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:41,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703713666] [2025-01-10 01:23:41,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703713666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:41,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:41,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:41,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508992449] [2025-01-10 01:23:41,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:41,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:41,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:41,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:41,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:23:41,894 INFO L87 Difference]: Start difference. First operand has 107 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 95 states have internal predecessors, (125), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:42,065 INFO L93 Difference]: Finished difference Result 255 states and 360 transitions. [2025-01-10 01:23:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:42,067 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:23:42,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:42,075 INFO L225 Difference]: With dead ends: 255 [2025-01-10 01:23:42,076 INFO L226 Difference]: Without dead ends: 141 [2025-01-10 01:23:42,080 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 01:23:42,083 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 80 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:42,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 348 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-10 01:23:42,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2025-01-10 01:23:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.5) internal successors, (162), 120 states have internal predecessors, (162), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 175 transitions. [2025-01-10 01:23:42,130 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 175 transitions. Word has length 8 [2025-01-10 01:23:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:42,130 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 175 transitions. [2025-01-10 01:23:42,130 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 175 transitions. [2025-01-10 01:23:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:23:42,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:42,131 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:42,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:23:42,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:42,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:42,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1214444242, now seen corresponding path program 1 times [2025-01-10 01:23:42,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:42,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445094347] [2025-01-10 01:23:42,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:42,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:42,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:23:42,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:23:42,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:42,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:23:42,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:42,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445094347] [2025-01-10 01:23:42,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445094347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:42,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:42,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:42,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936599944] [2025-01-10 01:23:42,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:42,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:42,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:42,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:42,190 INFO L87 Difference]: Start difference. First operand 131 states and 175 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:42,240 INFO L93 Difference]: Finished difference Result 131 states and 175 transitions. [2025-01-10 01:23:42,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:42,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 01:23:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:42,242 INFO L225 Difference]: With dead ends: 131 [2025-01-10 01:23:42,242 INFO L226 Difference]: Without dead ends: 130 [2025-01-10 01:23:42,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:42,243 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:42,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 208 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-10 01:23:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-01-10 01:23:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.4814814814814814) internal successors, (160), 119 states have internal predecessors, (160), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 173 transitions. [2025-01-10 01:23:42,275 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 173 transitions. Word has length 12 [2025-01-10 01:23:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:42,276 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 173 transitions. [2025-01-10 01:23:42,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 173 transitions. [2025-01-10 01:23:42,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:23:42,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:42,278 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:42,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:23:42,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:42,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1044353978, now seen corresponding path program 1 times [2025-01-10 01:23:42,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:42,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719822476] [2025-01-10 01:23:42,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:42,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:42,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:42,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:42,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:42,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:42,407 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 01:23:42,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719822476] [2025-01-10 01:23:42,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719822476] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525938561] [2025-01-10 01:23:42,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:42,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:42,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:42,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:42,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:23:42,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:42,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:42,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:42,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:42,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:42,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:42,531 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 01:23:42,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:42,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525938561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:42,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:42,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 01:23:42,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221308493] [2025-01-10 01:23:42,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:42,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:42,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:42,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:42,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:42,533 INFO L87 Difference]: Start difference. First operand 130 states and 173 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:42,613 INFO L93 Difference]: Finished difference Result 165 states and 229 transitions. [2025-01-10 01:23:42,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:42,616 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:23:42,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:42,617 INFO L225 Difference]: With dead ends: 165 [2025-01-10 01:23:42,617 INFO L226 Difference]: Without dead ends: 163 [2025-01-10 01:23:42,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:42,618 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 27 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:42,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 222 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:42,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-10 01:23:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 138. [2025-01-10 01:23:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.4655172413793103) internal successors, (170), 127 states have internal predecessors, (170), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 183 transitions. [2025-01-10 01:23:42,640 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 183 transitions. Word has length 13 [2025-01-10 01:23:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:42,640 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 183 transitions. [2025-01-10 01:23:42,641 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 183 transitions. [2025-01-10 01:23:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:23:42,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:42,643 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:42,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:23:42,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:42,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:42,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:42,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1006934111, now seen corresponding path program 1 times [2025-01-10 01:23:42,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:42,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438352937] [2025-01-10 01:23:42,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:42,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:42,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:42,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:42,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:42,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:42,937 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 01:23:42,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:42,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438352937] [2025-01-10 01:23:42,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438352937] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:42,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713948783] [2025-01-10 01:23:42,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:42,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:42,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:42,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:42,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:23:42,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:42,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:42,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:42,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:42,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:42,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:43,012 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 01:23:43,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:43,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713948783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:43,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:43,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 01:23:43,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798571536] [2025-01-10 01:23:43,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:43,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:43,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:43,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:43,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:43,014 INFO L87 Difference]: Start difference. First operand 138 states and 183 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:43,057 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2025-01-10 01:23:43,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:43,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:23:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:43,060 INFO L225 Difference]: With dead ends: 143 [2025-01-10 01:23:43,060 INFO L226 Difference]: Without dead ends: 142 [2025-01-10 01:23:43,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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 01:23:43,061 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 13 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:43,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 205 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:43,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-10 01:23:43,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2025-01-10 01:23:43,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 117 states have (on average 1.4615384615384615) internal successors, (171), 128 states have internal predecessors, (171), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 184 transitions. [2025-01-10 01:23:43,074 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 184 transitions. Word has length 13 [2025-01-10 01:23:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:43,074 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 184 transitions. [2025-01-10 01:23:43,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 184 transitions. [2025-01-10 01:23:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:23:43,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:43,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:43,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:23:43,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:43,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:43,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:43,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1984764969, now seen corresponding path program 1 times [2025-01-10 01:23:43,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:43,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223790121] [2025-01-10 01:23:43,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:43,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:43,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:23:43,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:23:43,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:43,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:23:43,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:43,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223790121] [2025-01-10 01:23:43,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223790121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:43,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:43,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:43,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343507443] [2025-01-10 01:23:43,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:43,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:43,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:43,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:43,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:43,313 INFO L87 Difference]: Start difference. First operand 139 states and 184 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:43,343 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2025-01-10 01:23:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:43,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:23:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:43,345 INFO L225 Difference]: With dead ends: 139 [2025-01-10 01:23:43,345 INFO L226 Difference]: Without dead ends: 138 [2025-01-10 01:23:43,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:43,346 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:43,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-10 01:23:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2025-01-10 01:23:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 115 states have (on average 1.4521739130434783) internal successors, (167), 125 states have internal predecessors, (167), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 180 transitions. [2025-01-10 01:23:43,354 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 180 transitions. Word has length 14 [2025-01-10 01:23:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:43,354 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 180 transitions. [2025-01-10 01:23:43,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 180 transitions. [2025-01-10 01:23:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:23:43,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:43,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:43,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:23:43,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:43,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:43,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1147099970, now seen corresponding path program 1 times [2025-01-10 01:23:43,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:43,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755472770] [2025-01-10 01:23:43,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:43,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:43,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:23:43,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:23:43,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:43,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:43,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:43,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755472770] [2025-01-10 01:23:43,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755472770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:43,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:43,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:43,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864465202] [2025-01-10 01:23:43,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:43,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:43,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:43,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:43,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:43,404 INFO L87 Difference]: Start difference. First operand 136 states and 180 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:43,444 INFO L93 Difference]: Finished difference Result 261 states and 345 transitions. [2025-01-10 01:23:43,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:43,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:23:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:43,446 INFO L225 Difference]: With dead ends: 261 [2025-01-10 01:23:43,446 INFO L226 Difference]: Without dead ends: 148 [2025-01-10 01:23:43,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:43,448 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 10 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:43,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 206 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-10 01:23:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2025-01-10 01:23:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 127 states have internal predecessors, (167), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 180 transitions. [2025-01-10 01:23:43,462 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 180 transitions. Word has length 14 [2025-01-10 01:23:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:43,462 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 180 transitions. [2025-01-10 01:23:43,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 180 transitions. [2025-01-10 01:23:43,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:23:43,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:43,463 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:43,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:23:43,464 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:43,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:43,464 INFO L85 PathProgramCache]: Analyzing trace with hash -329009907, now seen corresponding path program 1 times [2025-01-10 01:23:43,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:43,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118866644] [2025-01-10 01:23:43,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:43,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:43,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:23:43,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:23:43,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:43,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:43,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:43,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118866644] [2025-01-10 01:23:43,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118866644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:43,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:43,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:43,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564110436] [2025-01-10 01:23:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:43,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:43,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:43,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:43,513 INFO L87 Difference]: Start difference. First operand 138 states and 180 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:23:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:43,601 INFO L93 Difference]: Finished difference Result 200 states and 263 transitions. [2025-01-10 01:23:43,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:43,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 01:23:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:43,605 INFO L225 Difference]: With dead ends: 200 [2025-01-10 01:23:43,605 INFO L226 Difference]: Without dead ends: 198 [2025-01-10 01:23:43,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 01:23:43,606 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 73 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:43,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 384 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-10 01:23:43,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 167. [2025-01-10 01:23:43,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 145 states have (on average 1.4413793103448276) internal successors, (209), 155 states have internal predecessors, (209), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 222 transitions. [2025-01-10 01:23:43,627 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 222 transitions. Word has length 16 [2025-01-10 01:23:43,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:43,628 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 222 transitions. [2025-01-10 01:23:43,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:23:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 222 transitions. [2025-01-10 01:23:43,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:23:43,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:43,631 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:43,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:23:43,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:43,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash -329746929, now seen corresponding path program 1 times [2025-01-10 01:23:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:43,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762675580] [2025-01-10 01:23:43,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:43,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:43,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:23:43,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:23:43,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:43,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:43,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762675580] [2025-01-10 01:23:43,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762675580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:43,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:43,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:43,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668092051] [2025-01-10 01:23:43,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:43,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:43,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:43,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:43,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:43,704 INFO L87 Difference]: Start difference. First operand 167 states and 222 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:23:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:43,789 INFO L93 Difference]: Finished difference Result 193 states and 254 transitions. [2025-01-10 01:23:43,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:43,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 01:23:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:43,790 INFO L225 Difference]: With dead ends: 193 [2025-01-10 01:23:43,790 INFO L226 Difference]: Without dead ends: 191 [2025-01-10 01:23:43,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 01:23:43,791 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 73 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:43,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 388 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-10 01:23:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2025-01-10 01:23:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 152 states have (on average 1.4210526315789473) internal successors, (216), 162 states have internal predecessors, (216), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 229 transitions. [2025-01-10 01:23:43,801 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 229 transitions. Word has length 16 [2025-01-10 01:23:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:43,802 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 229 transitions. [2025-01-10 01:23:43,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:23:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 229 transitions. [2025-01-10 01:23:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:23:43,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:43,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:43,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:23:43,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:43,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:43,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1396008986, now seen corresponding path program 1 times [2025-01-10 01:23:43,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:43,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342118811] [2025-01-10 01:23:43,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:43,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:43,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:23:43,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:23:43,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:43,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:43,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:43,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342118811] [2025-01-10 01:23:43,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342118811] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:43,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549864599] [2025-01-10 01:23:43,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:43,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:43,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:43,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:43,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:23:43,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:23:43,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:23:43,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:43,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:43,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:43,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:43,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:43,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549864599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:43,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:43,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 01:23:43,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590400742] [2025-01-10 01:23:43,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:43,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:43,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:43,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:43,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:43,957 INFO L87 Difference]: Start difference. First operand 174 states and 229 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:44,022 INFO L93 Difference]: Finished difference Result 190 states and 253 transitions. [2025-01-10 01:23:44,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:44,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 01:23:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:44,025 INFO L225 Difference]: With dead ends: 190 [2025-01-10 01:23:44,025 INFO L226 Difference]: Without dead ends: 189 [2025-01-10 01:23:44,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:44,026 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 8 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:44,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 313 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-10 01:23:44,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2025-01-10 01:23:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 147 states have (on average 1.4149659863945578) internal successors, (208), 157 states have internal predecessors, (208), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 221 transitions. [2025-01-10 01:23:44,039 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 221 transitions. Word has length 15 [2025-01-10 01:23:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:44,039 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 221 transitions. [2025-01-10 01:23:44,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 221 transitions. [2025-01-10 01:23:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:23:44,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:44,040 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:44,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:44,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:44,241 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:44,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:44,241 INFO L85 PathProgramCache]: Analyzing trace with hash 105994534, now seen corresponding path program 1 times [2025-01-10 01:23:44,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:44,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707192913] [2025-01-10 01:23:44,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:44,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:23:44,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:23:44,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:44,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:23:44,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:44,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707192913] [2025-01-10 01:23:44,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707192913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:44,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:44,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:44,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449946873] [2025-01-10 01:23:44,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:44,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:44,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:44,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:44,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:44,301 INFO L87 Difference]: Start difference. First operand 169 states and 221 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:23:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:44,380 INFO L93 Difference]: Finished difference Result 187 states and 245 transitions. [2025-01-10 01:23:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:44,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-01-10 01:23:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:44,384 INFO L225 Difference]: With dead ends: 187 [2025-01-10 01:23:44,385 INFO L226 Difference]: Without dead ends: 185 [2025-01-10 01:23:44,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 01:23:44,386 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 72 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:44,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 377 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-10 01:23:44,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2025-01-10 01:23:44,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 140 states have (on average 1.4071428571428573) internal successors, (197), 148 states have internal predecessors, (197), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 210 transitions. [2025-01-10 01:23:44,400 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 210 transitions. Word has length 23 [2025-01-10 01:23:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:44,400 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 210 transitions. [2025-01-10 01:23:44,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:23:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 210 transitions. [2025-01-10 01:23:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:23:44,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:44,402 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:44,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:23:44,402 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:44,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:44,405 INFO L85 PathProgramCache]: Analyzing trace with hash 105257512, now seen corresponding path program 1 times [2025-01-10 01:23:44,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:44,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889436696] [2025-01-10 01:23:44,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:44,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:44,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:23:44,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:23:44,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:44,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:23:44,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:44,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889436696] [2025-01-10 01:23:44,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889436696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:44,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:44,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:44,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049726921] [2025-01-10 01:23:44,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:44,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:44,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:44,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:44,459 INFO L87 Difference]: Start difference. First operand 160 states and 210 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:23:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:44,541 INFO L93 Difference]: Finished difference Result 178 states and 234 transitions. [2025-01-10 01:23:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:44,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-01-10 01:23:44,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:44,543 INFO L225 Difference]: With dead ends: 178 [2025-01-10 01:23:44,543 INFO L226 Difference]: Without dead ends: 176 [2025-01-10 01:23:44,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 01:23:44,544 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 71 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:44,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 379 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-10 01:23:44,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 150. [2025-01-10 01:23:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 132 states have (on average 1.4015151515151516) internal successors, (185), 138 states have internal predecessors, (185), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 198 transitions. [2025-01-10 01:23:44,554 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 198 transitions. Word has length 23 [2025-01-10 01:23:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:44,554 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 198 transitions. [2025-01-10 01:23:44,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:23:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 198 transitions. [2025-01-10 01:23:44,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-10 01:23:44,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:44,555 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:44,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:23:44,555 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:44,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:44,556 INFO L85 PathProgramCache]: Analyzing trace with hash 303609118, now seen corresponding path program 1 times [2025-01-10 01:23:44,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:44,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374688419] [2025-01-10 01:23:44,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:44,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:44,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:23:44,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:23:44,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:44,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:44,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:44,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374688419] [2025-01-10 01:23:44,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374688419] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:44,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529447059] [2025-01-10 01:23:44,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:44,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:44,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:44,773 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:44,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:23:44,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:23:44,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:23:44,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:44,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:44,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:23:44,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:23:44,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:44,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529447059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:44,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:44,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2025-01-10 01:23:44,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992815884] [2025-01-10 01:23:44,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:44,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:44,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:44,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:44,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:23:44,884 INFO L87 Difference]: Start difference. First operand 150 states and 198 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:44,933 INFO L93 Difference]: Finished difference Result 150 states and 198 transitions. [2025-01-10 01:23:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:23:44,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2025-01-10 01:23:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:44,934 INFO L225 Difference]: With dead ends: 150 [2025-01-10 01:23:44,934 INFO L226 Difference]: Without dead ends: 149 [2025-01-10 01:23:44,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:23:44,935 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:44,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 391 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:44,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-10 01:23:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-01-10 01:23:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 132 states have (on average 1.393939393939394) internal successors, (184), 137 states have internal predecessors, (184), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 197 transitions. [2025-01-10 01:23:44,946 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 197 transitions. Word has length 41 [2025-01-10 01:23:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:44,946 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 197 transitions. [2025-01-10 01:23:44,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 197 transitions. [2025-01-10 01:23:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 01:23:44,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:44,947 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:44,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:23:45,147 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,SelfDestructingSolverStorable11 [2025-01-10 01:23:45,148 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:45,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:45,148 INFO L85 PathProgramCache]: Analyzing trace with hash 821948265, now seen corresponding path program 1 times [2025-01-10 01:23:45,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:45,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69967260] [2025-01-10 01:23:45,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:45,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:45,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:23:45,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:23:45,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:45,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:45,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69967260] [2025-01-10 01:23:45,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69967260] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:45,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519864053] [2025-01-10 01:23:45,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:45,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:45,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:45,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:45,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:23:45,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:23:45,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:23:45,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:45,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:45,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:23:45,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:45,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:23:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:45,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519864053] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:23:45,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:23:45,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-01-10 01:23:45,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958911663] [2025-01-10 01:23:45,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:23:45,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:23:45,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:45,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:23:45,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:23:45,637 INFO L87 Difference]: Start difference. First operand 149 states and 197 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-10 01:23:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:45,762 INFO L93 Difference]: Finished difference Result 223 states and 289 transitions. [2025-01-10 01:23:45,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:23:45,762 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 42 [2025-01-10 01:23:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:45,763 INFO L225 Difference]: With dead ends: 223 [2025-01-10 01:23:45,763 INFO L226 Difference]: Without dead ends: 171 [2025-01-10 01:23:45,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:23:45,764 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 17 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:45,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1214 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-10 01:23:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 162. [2025-01-10 01:23:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 141 states have (on average 1.375886524822695) internal successors, (194), 147 states have internal predecessors, (194), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-10 01:23:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 212 transitions. [2025-01-10 01:23:45,774 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 212 transitions. Word has length 42 [2025-01-10 01:23:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:45,775 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 212 transitions. [2025-01-10 01:23:45,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-10 01:23:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 212 transitions. [2025-01-10 01:23:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 01:23:45,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:45,776 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:45,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:45,976 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,SelfDestructingSolverStorable12 [2025-01-10 01:23:45,977 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:45,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:45,977 INFO L85 PathProgramCache]: Analyzing trace with hash -688761081, now seen corresponding path program 1 times [2025-01-10 01:23:45,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:45,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875927949] [2025-01-10 01:23:45,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:45,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:45,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 01:23:46,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:23:46,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:46,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:46,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:46,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875927949] [2025-01-10 01:23:46,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875927949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:46,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:46,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:23:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424101386] [2025-01-10 01:23:46,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:46,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:23:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:46,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:23:46,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:23:46,146 INFO L87 Difference]: Start difference. First operand 162 states and 212 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:46,214 INFO L93 Difference]: Finished difference Result 242 states and 309 transitions. [2025-01-10 01:23:46,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:23:46,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2025-01-10 01:23:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:46,216 INFO L225 Difference]: With dead ends: 242 [2025-01-10 01:23:46,216 INFO L226 Difference]: Without dead ends: 186 [2025-01-10 01:23:46,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:23:46,217 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:46,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 717 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-10 01:23:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 173. [2025-01-10 01:23:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 149 states have (on average 1.3557046979865772) internal successors, (202), 156 states have internal predecessors, (202), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-01-10 01:23:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 224 transitions. [2025-01-10 01:23:46,233 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 224 transitions. Word has length 45 [2025-01-10 01:23:46,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:46,234 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 224 transitions. [2025-01-10 01:23:46,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 224 transitions. [2025-01-10 01:23:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 01:23:46,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:46,235 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:46,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:23:46,236 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:46,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash 666420558, now seen corresponding path program 1 times [2025-01-10 01:23:46,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:46,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103708460] [2025-01-10 01:23:46,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:46,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:46,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 01:23:46,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:23:46,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:46,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:46,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103708460] [2025-01-10 01:23:46,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103708460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:46,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:46,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:23:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968611228] [2025-01-10 01:23:46,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:46,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:23:46,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:46,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:23:46,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:23:46,416 INFO L87 Difference]: Start difference. First operand 173 states and 224 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 01:23:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:46,522 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2025-01-10 01:23:46,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:23:46,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2025-01-10 01:23:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:46,524 INFO L225 Difference]: With dead ends: 275 [2025-01-10 01:23:46,525 INFO L226 Difference]: Without dead ends: 217 [2025-01-10 01:23:46,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:23:46,526 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 107 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:46,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 841 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-10 01:23:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 209. [2025-01-10 01:23:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 182 states have (on average 1.3461538461538463) internal successors, (245), 188 states have internal predecessors, (245), 13 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2025-01-10 01:23:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 272 transitions. [2025-01-10 01:23:46,543 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 272 transitions. Word has length 50 [2025-01-10 01:23:46,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:46,543 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 272 transitions. [2025-01-10 01:23:46,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 01:23:46,543 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 272 transitions. [2025-01-10 01:23:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 01:23:46,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:46,544 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:46,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:23:46,545 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:46,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:46,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1727179392, now seen corresponding path program 1 times [2025-01-10 01:23:46,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:46,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247082904] [2025-01-10 01:23:46,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:46,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 01:23:46,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:23:46,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:46,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:46,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:46,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247082904] [2025-01-10 01:23:46,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247082904] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:46,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048296282] [2025-01-10 01:23:46,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:46,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:46,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:46,717 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:46,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:23:46,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 01:23:46,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:23:46,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:46,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:46,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:23:46,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:46,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:23:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:47,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048296282] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:23:47,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:23:47,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2025-01-10 01:23:47,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674134622] [2025-01-10 01:23:47,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:23:47,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:23:47,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:47,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:23:47,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:23:47,303 INFO L87 Difference]: Start difference. First operand 209 states and 272 transitions. Second operand has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 18 states have internal predecessors, (63), 6 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-10 01:23:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:47,872 INFO L93 Difference]: Finished difference Result 410 states and 520 transitions. [2025-01-10 01:23:47,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 01:23:47,872 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 18 states have internal predecessors, (63), 6 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) Word has length 53 [2025-01-10 01:23:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:47,874 INFO L225 Difference]: With dead ends: 410 [2025-01-10 01:23:47,874 INFO L226 Difference]: Without dead ends: 266 [2025-01-10 01:23:47,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2025-01-10 01:23:47,877 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 185 mSDsluCounter, 2426 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 2598 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:47,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 2598 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:23:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-10 01:23:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 208. [2025-01-10 01:23:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 182 states have (on average 1.3406593406593406) internal successors, (244), 188 states have internal predecessors, (244), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-01-10 01:23:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 269 transitions. [2025-01-10 01:23:47,891 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 269 transitions. Word has length 53 [2025-01-10 01:23:47,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:47,891 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 269 transitions. [2025-01-10 01:23:47,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 18 states have internal predecessors, (63), 6 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-10 01:23:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 269 transitions. [2025-01-10 01:23:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 01:23:47,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:47,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:47,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:23:48,093 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,SelfDestructingSolverStorable15 [2025-01-10 01:23:48,094 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:48,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1326409409, now seen corresponding path program 2 times [2025-01-10 01:23:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:48,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099956455] [2025-01-10 01:23:48,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:23:48,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:48,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-10 01:23:48,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 48 statements. [2025-01-10 01:23:48,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:23:48,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:23:48,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:48,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099956455] [2025-01-10 01:23:48,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099956455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:48,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:48,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:23:48,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318313456] [2025-01-10 01:23:48,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:48,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:23:48,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:48,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:23:48,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:23:48,351 INFO L87 Difference]: Start difference. First operand 208 states and 269 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:48,599 INFO L93 Difference]: Finished difference Result 381 states and 488 transitions. [2025-01-10 01:23:48,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:23:48,600 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2025-01-10 01:23:48,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:48,601 INFO L225 Difference]: With dead ends: 381 [2025-01-10 01:23:48,602 INFO L226 Difference]: Without dead ends: 303 [2025-01-10 01:23:48,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:23:48,602 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 127 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:48,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1418 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:23:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-10 01:23:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 246. [2025-01-10 01:23:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 218 states have (on average 1.353211009174312) internal successors, (295), 224 states have internal predecessors, (295), 14 states have call successors, (14), 8 states have call predecessors, (14), 9 states have return successors, (14), 13 states have call predecessors, (14), 12 states have call successors, (14) [2025-01-10 01:23:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 323 transitions. [2025-01-10 01:23:48,620 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 323 transitions. Word has length 48 [2025-01-10 01:23:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:48,620 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 323 transitions. [2025-01-10 01:23:48,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 323 transitions. [2025-01-10 01:23:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 01:23:48,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:48,621 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:48,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:23:48,621 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:48,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:48,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1380209985, now seen corresponding path program 1 times [2025-01-10 01:23:48,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:48,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751070489] [2025-01-10 01:23:48,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:48,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:48,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:23:48,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:23:48,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:48,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:23:48,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:48,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751070489] [2025-01-10 01:23:48,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751070489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:48,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:48,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:23:48,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614602995] [2025-01-10 01:23:48,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:48,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:23:48,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:48,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:23:48,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:23:48,975 INFO L87 Difference]: Start difference. First operand 246 states and 323 transitions. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:49,163 INFO L93 Difference]: Finished difference Result 276 states and 357 transitions. [2025-01-10 01:23:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:23:49,164 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2025-01-10 01:23:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:49,165 INFO L225 Difference]: With dead ends: 276 [2025-01-10 01:23:49,165 INFO L226 Difference]: Without dead ends: 272 [2025-01-10 01:23:49,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:23:49,166 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 134 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:49,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 842 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-10 01:23:49,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 255. [2025-01-10 01:23:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 226 states have (on average 1.323008849557522) internal successors, (299), 230 states have internal predecessors, (299), 17 states have call successors, (17), 8 states have call predecessors, (17), 9 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2025-01-10 01:23:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 333 transitions. [2025-01-10 01:23:49,182 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 333 transitions. Word has length 48 [2025-01-10 01:23:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:49,182 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 333 transitions. [2025-01-10 01:23:49,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 333 transitions. [2025-01-10 01:23:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 01:23:49,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:49,183 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:49,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:23:49,183 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:49,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1725933912, now seen corresponding path program 1 times [2025-01-10 01:23:49,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:49,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321867270] [2025-01-10 01:23:49,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:49,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 01:23:49,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 01:23:49,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:49,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:23:49,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:49,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321867270] [2025-01-10 01:23:49,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321867270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:49,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:49,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859513631] [2025-01-10 01:23:49,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:49,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:49,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:49,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:49,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:49,268 INFO L87 Difference]: Start difference. First operand 255 states and 333 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:49,320 INFO L93 Difference]: Finished difference Result 261 states and 339 transitions. [2025-01-10 01:23:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:49,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2025-01-10 01:23:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:49,322 INFO L225 Difference]: With dead ends: 261 [2025-01-10 01:23:49,323 INFO L226 Difference]: Without dead ends: 256 [2025-01-10 01:23:49,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:49,323 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:49,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 157 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-10 01:23:49,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2025-01-10 01:23:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 224 states have (on average 1.2857142857142858) internal successors, (288), 226 states have internal predecessors, (288), 16 states have call successors, (16), 8 states have call predecessors, (16), 9 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2025-01-10 01:23:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 320 transitions. [2025-01-10 01:23:49,339 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 320 transitions. Word has length 56 [2025-01-10 01:23:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:49,340 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 320 transitions. [2025-01-10 01:23:49,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 320 transitions. [2025-01-10 01:23:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 01:23:49,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:49,341 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:49,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:23:49,342 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:49,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash 399618612, now seen corresponding path program 1 times [2025-01-10 01:23:49,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:49,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540611760] [2025-01-10 01:23:49,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:49,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 01:23:49,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 01:23:49,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:49,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:23:49,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:49,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540611760] [2025-01-10 01:23:49,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540611760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:49,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:49,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:23:49,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125340565] [2025-01-10 01:23:49,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:49,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:23:49,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:49,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:23:49,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:23:49,487 INFO L87 Difference]: Start difference. First operand 250 states and 320 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 01:23:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:49,626 INFO L93 Difference]: Finished difference Result 463 states and 592 transitions. [2025-01-10 01:23:49,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:23:49,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 65 [2025-01-10 01:23:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:49,629 INFO L225 Difference]: With dead ends: 463 [2025-01-10 01:23:49,629 INFO L226 Difference]: Without dead ends: 356 [2025-01-10 01:23:49,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:23:49,630 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 33 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:49,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 645 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-10 01:23:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 289. [2025-01-10 01:23:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 260 states have (on average 1.2692307692307692) internal successors, (330), 262 states have internal predecessors, (330), 19 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (19), 18 states have call predecessors, (19), 17 states have call successors, (19) [2025-01-10 01:23:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 368 transitions. [2025-01-10 01:23:49,647 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 368 transitions. Word has length 65 [2025-01-10 01:23:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:49,647 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 368 transitions. [2025-01-10 01:23:49,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 01:23:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 368 transitions. [2025-01-10 01:23:49,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 01:23:49,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:49,649 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:49,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:23:49,649 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:49,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1986070094, now seen corresponding path program 1 times [2025-01-10 01:23:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:49,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418881330] [2025-01-10 01:23:49,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:49,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 01:23:49,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 01:23:49,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:49,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:23:49,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:49,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418881330] [2025-01-10 01:23:49,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418881330] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:49,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139265553] [2025-01-10 01:23:49,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:49,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:49,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:49,913 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:49,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:23:49,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 01:23:49,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 01:23:49,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:49,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:49,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 01:23:49,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:23:50,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:50,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139265553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:50,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:50,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 16 [2025-01-10 01:23:50,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35396159] [2025-01-10 01:23:50,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:50,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:23:50,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:50,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:23:50,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:23:50,193 INFO L87 Difference]: Start difference. First operand 289 states and 368 transitions. Second operand has 13 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 01:23:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:50,467 INFO L93 Difference]: Finished difference Result 502 states and 633 transitions. [2025-01-10 01:23:50,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:23:50,468 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 66 [2025-01-10 01:23:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:50,469 INFO L225 Difference]: With dead ends: 502 [2025-01-10 01:23:50,469 INFO L226 Difference]: Without dead ends: 305 [2025-01-10 01:23:50,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:23:50,471 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 117 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:50,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 998 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:23:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-10 01:23:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 294. [2025-01-10 01:23:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 263 states have (on average 1.2661596958174905) internal successors, (333), 266 states have internal predecessors, (333), 20 states have call successors, (20), 8 states have call predecessors, (20), 10 states have return successors, (22), 19 states have call predecessors, (22), 18 states have call successors, (22) [2025-01-10 01:23:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 375 transitions. [2025-01-10 01:23:50,490 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 375 transitions. Word has length 66 [2025-01-10 01:23:50,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:50,490 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 375 transitions. [2025-01-10 01:23:50,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 01:23:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 375 transitions. [2025-01-10 01:23:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 01:23:50,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:50,491 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:50,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:50,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:50,696 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:50,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:50,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2074864315, now seen corresponding path program 1 times [2025-01-10 01:23:50,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:50,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123742171] [2025-01-10 01:23:50,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:50,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:50,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 01:23:50,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 01:23:50,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:50,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:23:50,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:50,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123742171] [2025-01-10 01:23:50,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123742171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:50,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:50,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:23:50,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724428943] [2025-01-10 01:23:50,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:50,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:23:50,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:50,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:23:50,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:23:50,875 INFO L87 Difference]: Start difference. First operand 294 states and 375 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:23:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:50,969 INFO L93 Difference]: Finished difference Result 351 states and 440 transitions. [2025-01-10 01:23:50,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:23:50,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2025-01-10 01:23:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:50,972 INFO L225 Difference]: With dead ends: 351 [2025-01-10 01:23:50,972 INFO L226 Difference]: Without dead ends: 286 [2025-01-10 01:23:50,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:23:50,974 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 2 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:50,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 803 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-10 01:23:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2025-01-10 01:23:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 255 states have (on average 1.2666666666666666) internal successors, (323), 257 states have internal predecessors, (323), 19 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (19), 18 states have call predecessors, (19), 17 states have call successors, (19) [2025-01-10 01:23:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 361 transitions. [2025-01-10 01:23:50,989 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 361 transitions. Word has length 71 [2025-01-10 01:23:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:50,989 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 361 transitions. [2025-01-10 01:23:50,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:23:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 361 transitions. [2025-01-10 01:23:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 01:23:50,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:50,991 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:50,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:23:50,991 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:50,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:50,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1432434159, now seen corresponding path program 1 times [2025-01-10 01:23:50,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:50,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711010228] [2025-01-10 01:23:50,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:50,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:50,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 01:23:51,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 01:23:51,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:51,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:23:51,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:51,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711010228] [2025-01-10 01:23:51,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711010228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:51,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599491702] [2025-01-10 01:23:51,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:51,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:51,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:51,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:51,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:51,040 INFO L87 Difference]: Start difference. First operand 283 states and 361 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:23:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:51,081 INFO L93 Difference]: Finished difference Result 553 states and 705 transitions. [2025-01-10 01:23:51,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:51,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2025-01-10 01:23:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:51,083 INFO L225 Difference]: With dead ends: 553 [2025-01-10 01:23:51,084 INFO L226 Difference]: Without dead ends: 294 [2025-01-10 01:23:51,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:51,085 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:51,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:51,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-10 01:23:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 288. [2025-01-10 01:23:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 260 states have (on average 1.2576923076923077) internal successors, (327), 262 states have internal predecessors, (327), 19 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (19), 18 states have call predecessors, (19), 17 states have call successors, (19) [2025-01-10 01:23:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 365 transitions. [2025-01-10 01:23:51,104 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 365 transitions. Word has length 72 [2025-01-10 01:23:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:51,104 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 365 transitions. [2025-01-10 01:23:51,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:23:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 365 transitions. [2025-01-10 01:23:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-10 01:23:51,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:51,106 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:23:51,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 01:23:51,106 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:51,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1504598471, now seen corresponding path program 1 times [2025-01-10 01:23:51,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:51,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655788474] [2025-01-10 01:23:51,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:51,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:51,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-10 01:23:51,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 01:23:51,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:51,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:23:51,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:51,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655788474] [2025-01-10 01:23:51,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655788474] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:51,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358438021] [2025-01-10 01:23:51,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:51,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:51,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:51,300 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 01:23:51,302 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 01:23:51,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-10 01:23:51,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 01:23:51,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:51,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:51,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:23:51,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:23:51,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:23:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:23:51,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358438021] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:23:51,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:23:51,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 16 [2025-01-10 01:23:51,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549611713] [2025-01-10 01:23:51,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:23:51,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:23:51,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:51,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:23:51,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:23:51,585 INFO L87 Difference]: Start difference. First operand 288 states and 365 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 01:23:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:51,862 INFO L93 Difference]: Finished difference Result 525 states and 663 transitions. [2025-01-10 01:23:51,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:23:51,863 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 81 [2025-01-10 01:23:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:51,865 INFO L225 Difference]: With dead ends: 525 [2025-01-10 01:23:51,865 INFO L226 Difference]: Without dead ends: 397 [2025-01-10 01:23:51,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:23:51,866 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 126 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:51,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1480 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:23:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-01-10 01:23:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 289. [2025-01-10 01:23:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 261 states have (on average 1.2528735632183907) internal successors, (327), 263 states have internal predecessors, (327), 19 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (19), 18 states have call predecessors, (19), 17 states have call successors, (19) [2025-01-10 01:23:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 365 transitions. [2025-01-10 01:23:51,884 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 365 transitions. Word has length 81 [2025-01-10 01:23:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:51,885 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 365 transitions. [2025-01-10 01:23:51,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 01:23:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 365 transitions. [2025-01-10 01:23:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 01:23:51,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:51,886 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:23:51,894 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 01:23:52,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:52,087 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:52,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash 170663190, now seen corresponding path program 1 times [2025-01-10 01:23:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:52,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010676013] [2025-01-10 01:23:52,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:52,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:52,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 01:23:52,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 01:23:52,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:52,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:23:52,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010676013] [2025-01-10 01:23:52,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010676013] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864186605] [2025-01-10 01:23:52,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:52,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:52,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:52,244 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 01:23:52,246 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 01:23:52,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 01:23:52,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 01:23:52,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:52,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:52,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:23:52,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:23:52,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:23:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:23:52,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864186605] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:23:52,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:23:52,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2025-01-10 01:23:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390113340] [2025-01-10 01:23:52,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:23:52,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:23:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:52,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:23:52,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:23:52,568 INFO L87 Difference]: Start difference. First operand 289 states and 365 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-10 01:23:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:52,711 INFO L93 Difference]: Finished difference Result 427 states and 538 transitions. [2025-01-10 01:23:52,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:23:52,711 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 73 [2025-01-10 01:23:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:52,713 INFO L225 Difference]: With dead ends: 427 [2025-01-10 01:23:52,713 INFO L226 Difference]: Without dead ends: 361 [2025-01-10 01:23:52,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:23:52,714 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 99 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:52,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1192 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-01-10 01:23:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2025-01-10 01:23:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 315 states have (on average 1.253968253968254) internal successors, (395), 317 states have internal predecessors, (395), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (24), 23 states have call predecessors, (24), 22 states have call successors, (24) [2025-01-10 01:23:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 443 transitions. [2025-01-10 01:23:52,751 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 443 transitions. Word has length 73 [2025-01-10 01:23:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:52,752 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 443 transitions. [2025-01-10 01:23:52,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-10 01:23:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 443 transitions. [2025-01-10 01:23:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 01:23:52,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:52,755 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:23:52,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:23:52,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:52,956 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:52,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:52,957 INFO L85 PathProgramCache]: Analyzing trace with hash -673342312, now seen corresponding path program 1 times [2025-01-10 01:23:52,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:52,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601629141] [2025-01-10 01:23:52,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:52,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:52,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 01:23:52,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 01:23:52,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:52,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:23:53,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:53,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601629141] [2025-01-10 01:23:53,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601629141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:53,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:53,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:53,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822335932] [2025-01-10 01:23:53,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:53,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:53,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:53,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:53,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:23:53,080 INFO L87 Difference]: Start difference. First operand 349 states and 443 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 01:23:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:53,115 INFO L93 Difference]: Finished difference Result 364 states and 464 transitions. [2025-01-10 01:23:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 73 [2025-01-10 01:23:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:53,115 INFO L225 Difference]: With dead ends: 364 [2025-01-10 01:23:53,115 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:23:53,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 01:23:53,117 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 41 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:53,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 158 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:23:53,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:23:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:23:53,117 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2025-01-10 01:23:53,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:53,117 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:23:53,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 01:23:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:23:53,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:23:53,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-01-10 01:23:53,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-01-10 01:23:53,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-01-10 01:23:53,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-01-10 01:23:53,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-01-10 01:23:53,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-01-10 01:23:53,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-01-10 01:23:53,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-01-10 01:23:53,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-01-10 01:23:53,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-01-10 01:23:53,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-01-10 01:23:53,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-01-10 01:23:53,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-01-10 01:23:53,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-01-10 01:23:53,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-01-10 01:23:53,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-01-10 01:23:53,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 01:23:53,124 INFO L422 BasicCegarLoop]: Path program histogram: [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 01:23:53,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:23:57,244 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:23:57,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:23:57 BoogieIcfgContainer [2025-01-10 01:23:57,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:23:57,263 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:23:57,263 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:23:57,264 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:23:57,264 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:41" (3/4) ... [2025-01-10 01:23:57,266 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:23:57,271 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2025-01-10 01:23:57,272 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2025-01-10 01:23:57,272 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 01:23:57,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2025-01-10 01:23:57,282 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-10 01:23:57,282 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:23:57,282 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:23:57,306 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) [2025-01-10 01:23:57,307 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) [2025-01-10 01:23:57,333 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) [2025-01-10 01:23:57,333 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) [2025-01-10 01:23:57,371 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:23:57,371 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:23:57,371 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:23:57,372 INFO L158 Benchmark]: Toolchain (without parser) took 16701.28ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 104.4MB in the beginning and 147.5MB in the end (delta: -43.1MB). Peak memory consumption was 225.2MB. Max. memory is 16.1GB. [2025-01-10 01:23:57,372 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 192.9MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:57,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.42ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 90.9MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:23:57,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.27ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:57,373 INFO L158 Benchmark]: Boogie Preprocessor took 33.19ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 87.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:57,374 INFO L158 Benchmark]: RCFGBuilder took 553.26ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 66.6MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:23:57,374 INFO L158 Benchmark]: TraceAbstraction took 15683.43ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 66.2MB in the beginning and 151.8MB in the end (delta: -85.6MB). Peak memory consumption was 199.2MB. Max. memory is 16.1GB. [2025-01-10 01:23:57,374 INFO L158 Benchmark]: Witness Printer took 108.13ms. Allocated memory is still 411.0MB. Free memory was 151.8MB in the beginning and 147.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:23:57,375 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 192.9MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.42ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 90.9MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.27ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.19ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 87.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 553.26ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 66.6MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15683.43ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 66.2MB in the beginning and 151.8MB in the end (delta: -85.6MB). Peak memory consumption was 199.2MB. Max. memory is 16.1GB. * Witness Printer took 108.13ms. Allocated memory is still 411.0MB. Free memory was 151.8MB in the beginning and 147.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 113]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 113]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 116]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 116]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 107 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1491 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1452 mSDsluCounter, 16878 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14009 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2666 IncrementalHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 2869 mSDtfsCounter, 2666 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 854 GetRequests, 642 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=25, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 544 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1448 NumberOfCodeBlocks, 1431 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1658 ConstructedInterpolants, 0 QuantifiedInterpolants, 2962 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1182 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 39 InterpolantComputations, 22 PerfectInterpolantSequences, 480/523 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:23:57,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE