./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:38:49,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:38:49,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:38:49,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:38:49,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:38:49,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:38:49,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:38:49,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:38:49,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:38:49,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:38:49,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:38:49,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:38:49,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:38:49,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:38:49,144 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:38:49,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:38:49,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:38:49,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:38:49,145 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:38:49,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:38:49,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:38:49,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:38:49,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:38:49,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:38:49,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:38:49,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:38:49,146 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/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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2025-03-09 01:38:49,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:38:49,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:38:49,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:38:49,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:38:49,368 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:38:49,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2025-03-09 01:38:50,522 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8009f2a45/2ac54ec571674982bfddbc43ade07143/FLAGe38c29c8a [2025-03-09 01:38:50,763 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:38:50,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2025-03-09 01:38:50,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8009f2a45/2ac54ec571674982bfddbc43ade07143/FLAGe38c29c8a [2025-03-09 01:38:50,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8009f2a45/2ac54ec571674982bfddbc43ade07143 [2025-03-09 01:38:50,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:38:50,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:38:50,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:38:50,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:38:50,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:38:50,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:38:50" (1/1) ... [2025-03-09 01:38:50,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3a095d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:50, skipping insertion in model container [2025-03-09 01:38:50,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:38:50" (1/1) ... [2025-03-09 01:38:50,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:38:50,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:38:50,984 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:38:51,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:38:51,042 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:38:51,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51 WrapperNode [2025-03-09 01:38:51,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:38:51,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:38:51,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:38:51,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:38:51,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51" (1/1) ... [2025-03-09 01:38:51,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51" (1/1) ... [2025-03-09 01:38:51,078 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 207 [2025-03-09 01:38:51,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:38:51,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:38:51,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:38:51,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:38:51,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51" (1/1) ... [2025-03-09 01:38:51,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51" (1/1) ... [2025-03-09 01:38:51,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51" (1/1) ... [2025-03-09 01:38:51,103 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-03-09 01:38:51,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51" (1/1) ... [2025-03-09 01:38:51,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51" (1/1) ... [2025-03-09 01:38:51,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51" (1/1) ... [2025-03-09 01:38:51,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51" (1/1) ... [2025-03-09 01:38:51,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51" (1/1) ... [2025-03-09 01:38:51,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51" (1/1) ... [2025-03-09 01:38:51,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:38:51,110 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:38:51,110 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:38:51,110 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:38:51,111 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51" (1/1) ... [2025-03-09 01:38:51,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:38:51,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:38:51,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:38:51,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:38:51,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:38:51,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:38:51,163 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-09 01:38:51,163 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-09 01:38:51,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:38:51,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:38:51,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 01:38:51,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 01:38:51,220 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:38:51,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:38:51,531 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2025-03-09 01:38:51,531 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:38:51,547 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:38:51,547 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-09 01:38:51,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:38:51 BoogieIcfgContainer [2025-03-09 01:38:51,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:38:51,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:38:51,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:38:51,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:38:51,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:38:50" (1/3) ... [2025-03-09 01:38:51,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b72e921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:38:51, skipping insertion in model container [2025-03-09 01:38:51,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:38:51" (2/3) ... [2025-03-09 01:38:51,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b72e921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:38:51, skipping insertion in model container [2025-03-09 01:38:51,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:38:51" (3/3) ... [2025-03-09 01:38:51,554 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2025-03-09 01:38:51,564 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:38:51,565 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-2a.c.cil.c that has 3 procedures, 125 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-03-09 01:38:51,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:38:51,603 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;@1015bfb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:38:51,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-09 01:38:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 98 states have (on average 1.6326530612244898) internal successors, (160), 116 states have internal predecessors, (160), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 01:38:51,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:38:51,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:51,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:38:51,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:51,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:51,612 INFO L85 PathProgramCache]: Analyzing trace with hash 870065275, now seen corresponding path program 1 times [2025-03-09 01:38:51,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:51,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576355653] [2025-03-09 01:38:51,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:51,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:51,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:38:51,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:38:51,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:51,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:38:51,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:51,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576355653] [2025-03-09 01:38:51,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576355653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:51,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:51,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:38:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205542017] [2025-03-09 01:38:51,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:51,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:38:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:51,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:38:51,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:38:51,804 INFO L87 Difference]: Start difference. First operand has 125 states, 98 states have (on average 1.6326530612244898) internal successors, (160), 116 states have internal predecessors, (160), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 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-03-09 01:38:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:51,932 INFO L93 Difference]: Finished difference Result 291 states and 430 transitions. [2025-03-09 01:38:51,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:38:51,934 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-03-09 01:38:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:51,940 INFO L225 Difference]: With dead ends: 291 [2025-03-09 01:38:51,940 INFO L226 Difference]: Without dead ends: 137 [2025-03-09 01:38:51,944 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-03-09 01:38:51,947 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 80 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:51,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 434 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:51,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-09 01:38:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2025-03-09 01:38:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 107 states have (on average 1.485981308411215) internal successors, (159), 118 states have internal predecessors, (159), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:38:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 169 transitions. [2025-03-09 01:38:51,989 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 169 transitions. Word has length 8 [2025-03-09 01:38:51,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:51,989 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 169 transitions. [2025-03-09 01:38:51,989 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-03-09 01:38:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 169 transitions. [2025-03-09 01:38:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:38:51,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:51,991 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:38:51,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:38:51,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:51,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash -403986891, now seen corresponding path program 1 times [2025-03-09 01:38:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105911927] [2025-03-09 01:38:51,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:52,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:38:52,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:38:52,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:52,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:38:52,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:52,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105911927] [2025-03-09 01:38:52,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105911927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:52,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:52,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:38:52,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197675808] [2025-03-09 01:38:52,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:52,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:38:52,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:52,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:38:52,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:38:52,056 INFO L87 Difference]: Start difference. First operand 127 states and 169 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-03-09 01:38:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:52,110 INFO L93 Difference]: Finished difference Result 127 states and 169 transitions. [2025-03-09 01:38:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:38:52,112 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-03-09 01:38:52,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:52,113 INFO L225 Difference]: With dead ends: 127 [2025-03-09 01:38:52,114 INFO L226 Difference]: Without dead ends: 126 [2025-03-09 01:38:52,114 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-03-09 01:38:52,114 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:52,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 185 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:38:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-09 01:38:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-09 01:38:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 117 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:38:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2025-03-09 01:38:52,129 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 12 [2025-03-09 01:38:52,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:52,129 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2025-03-09 01:38:52,129 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-03-09 01:38:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2025-03-09 01:38:52,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:38:52,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:52,130 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:38:52,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:38:52,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:52,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:52,130 INFO L85 PathProgramCache]: Analyzing trace with hash 361308259, now seen corresponding path program 1 times [2025-03-09 01:38:52,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:52,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125606838] [2025-03-09 01:38:52,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:52,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:52,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:38:52,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:38:52,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:52,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:38:52,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:52,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125606838] [2025-03-09 01:38:52,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125606838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:38:52,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758432810] [2025-03-09 01:38:52,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:52,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:52,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:38:52,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:38:52,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:38:52,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:38:52,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:38:52,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:52,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:52,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:38:52,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:38:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:38:52,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:38:52,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758432810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:52,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:38:52,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 01:38:52,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342406315] [2025-03-09 01:38:52,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:52,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:38:52,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:52,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:38:52,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:38:52,336 INFO L87 Difference]: Start difference. First operand 126 states and 167 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-03-09 01:38:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:52,401 INFO L93 Difference]: Finished difference Result 138 states and 186 transitions. [2025-03-09 01:38:52,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:38:52,402 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-03-09 01:38:52,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:52,403 INFO L225 Difference]: With dead ends: 138 [2025-03-09 01:38:52,404 INFO L226 Difference]: Without dead ends: 137 [2025-03-09 01:38:52,405 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-03-09 01:38:52,405 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:52,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 181 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-09 01:38:52,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2025-03-09 01:38:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.462962962962963) internal successors, (158), 118 states have internal predecessors, (158), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:38:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 168 transitions. [2025-03-09 01:38:52,415 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 168 transitions. Word has length 13 [2025-03-09 01:38:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:52,415 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 168 transitions. [2025-03-09 01:38:52,415 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-03-09 01:38:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 168 transitions. [2025-03-09 01:38:52,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:38:52,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:52,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:38:52,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:38:52,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:52,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:52,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:52,618 INFO L85 PathProgramCache]: Analyzing trace with hash 361323251, now seen corresponding path program 1 times [2025-03-09 01:38:52,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:52,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44848064] [2025-03-09 01:38:52,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:52,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:52,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:38:52,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:38:52,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:52,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:38:52,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:52,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44848064] [2025-03-09 01:38:52,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44848064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:52,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:52,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:38:52,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381265730] [2025-03-09 01:38:52,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:52,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:38:52,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:52,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:38:52,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:38:52,667 INFO L87 Difference]: Start difference. First operand 127 states and 168 transitions. Second operand has 3 states, 3 states have (on average 4.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-03-09 01:38:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:52,715 INFO L93 Difference]: Finished difference Result 242 states and 319 transitions. [2025-03-09 01:38:52,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:38:52,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.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-03-09 01:38:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:52,718 INFO L225 Difference]: With dead ends: 242 [2025-03-09 01:38:52,718 INFO L226 Difference]: Without dead ends: 140 [2025-03-09 01:38:52,719 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-03-09 01:38:52,719 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:52,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 186 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:38:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-09 01:38:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2025-03-09 01:38:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 121 states have internal predecessors, (161), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:38:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 171 transitions. [2025-03-09 01:38:52,733 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 171 transitions. Word has length 13 [2025-03-09 01:38:52,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:52,733 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 171 transitions. [2025-03-09 01:38:52,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.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-03-09 01:38:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 171 transitions. [2025-03-09 01:38:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:38:52,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:52,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:38:52,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:38:52,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:52,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1552653560, now seen corresponding path program 1 times [2025-03-09 01:38:52,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:52,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275948991] [2025-03-09 01:38:52,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:52,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:38:52,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:38:52,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:52,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:38:52,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:52,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275948991] [2025-03-09 01:38:52,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275948991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:38:52,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760255719] [2025-03-09 01:38:52,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:52,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:52,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:38:52,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:38:52,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:38:52,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:38:52,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:38:52,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:52,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:52,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:38:52,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:38:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:38:52,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:38:52,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760255719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:52,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:38:52,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-09 01:38:52,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498650622] [2025-03-09 01:38:52,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:52,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:38:52,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:52,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:38:52,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:38:52,860 INFO L87 Difference]: Start difference. First operand 130 states and 171 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-03-09 01:38:52,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:52,939 INFO L93 Difference]: Finished difference Result 161 states and 218 transitions. [2025-03-09 01:38:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:38:52,939 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-03-09 01:38:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:52,941 INFO L225 Difference]: With dead ends: 161 [2025-03-09 01:38:52,941 INFO L226 Difference]: Without dead ends: 159 [2025-03-09 01:38:52,942 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-03-09 01:38:52,942 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 24 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:52,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 273 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-09 01:38:52,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2025-03-09 01:38:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 118 states have (on average 1.423728813559322) internal successors, (168), 128 states have internal predecessors, (168), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:38:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 178 transitions. [2025-03-09 01:38:52,957 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 178 transitions. Word has length 13 [2025-03-09 01:38:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:52,957 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 178 transitions. [2025-03-09 01:38:52,957 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-03-09 01:38:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2025-03-09 01:38:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:38:52,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:52,958 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:38:52,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:38:53,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:53,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:53,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:53,161 INFO L85 PathProgramCache]: Analyzing trace with hash -887620104, now seen corresponding path program 1 times [2025-03-09 01:38:53,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:53,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283130546] [2025-03-09 01:38:53,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:53,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:53,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:38:53,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:38:53,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:53,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:38:53,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283130546] [2025-03-09 01:38:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283130546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:53,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:53,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:38:53,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794921166] [2025-03-09 01:38:53,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:53,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:38:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:53,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:38:53,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:38:53,202 INFO L87 Difference]: Start difference. First operand 137 states and 178 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-03-09 01:38:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:53,234 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2025-03-09 01:38:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:38:53,235 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-03-09 01:38:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:53,236 INFO L225 Difference]: With dead ends: 137 [2025-03-09 01:38:53,236 INFO L226 Difference]: Without dead ends: 136 [2025-03-09 01:38:53,236 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-03-09 01:38:53,236 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:53,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:38:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-09 01:38:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2025-03-09 01:38:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 125 states have internal predecessors, (164), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:38:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 174 transitions. [2025-03-09 01:38:53,248 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 174 transitions. Word has length 14 [2025-03-09 01:38:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:53,248 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 174 transitions. [2025-03-09 01:38:53,248 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-03-09 01:38:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2025-03-09 01:38:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:38:53,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:53,249 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:38:53,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:38:53,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:53,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1497242628, now seen corresponding path program 1 times [2025-03-09 01:38:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:53,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919302034] [2025-03-09 01:38:53,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:53,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:53,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:38:53,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:38:53,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:53,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:38:53,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:53,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919302034] [2025-03-09 01:38:53,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919302034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:53,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:53,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:38:53,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144162236] [2025-03-09 01:38:53,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:53,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:38:53,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:53,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:38:53,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:38:53,308 INFO L87 Difference]: Start difference. First operand 134 states and 174 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-03-09 01:38:53,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:53,390 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2025-03-09 01:38:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:38:53,390 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-03-09 01:38:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:53,391 INFO L225 Difference]: With dead ends: 197 [2025-03-09 01:38:53,392 INFO L226 Difference]: Without dead ends: 195 [2025-03-09 01:38:53,393 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-03-09 01:38:53,393 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 129 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:53,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 289 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:53,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-09 01:38:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 177. [2025-03-09 01:38:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.4177215189873418) internal successors, (224), 167 states have internal predecessors, (224), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:38:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2025-03-09 01:38:53,410 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 16 [2025-03-09 01:38:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:53,410 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2025-03-09 01:38:53,410 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-03-09 01:38:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2025-03-09 01:38:53,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:38:53,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:53,411 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:38:53,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:38:53,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:53,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:53,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1497202845, now seen corresponding path program 1 times [2025-03-09 01:38:53,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666110177] [2025-03-09 01:38:53,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:53,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:38:53,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:38:53,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:53,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:38:53,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666110177] [2025-03-09 01:38:53,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666110177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:53,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:53,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:38:53,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593780511] [2025-03-09 01:38:53,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:53,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:38:53,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:53,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:38:53,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:38:53,465 INFO L87 Difference]: Start difference. First operand 177 states and 234 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-03-09 01:38:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:53,542 INFO L93 Difference]: Finished difference Result 194 states and 253 transitions. [2025-03-09 01:38:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:38:53,543 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-03-09 01:38:53,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:53,545 INFO L225 Difference]: With dead ends: 194 [2025-03-09 01:38:53,545 INFO L226 Difference]: Without dead ends: 192 [2025-03-09 01:38:53,546 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-03-09 01:38:53,546 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 123 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:53,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 291 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-09 01:38:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 170. [2025-03-09 01:38:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 151 states have (on average 1.4105960264900663) internal successors, (213), 160 states have internal predecessors, (213), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:38:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 223 transitions. [2025-03-09 01:38:53,554 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 223 transitions. Word has length 16 [2025-03-09 01:38:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:53,554 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 223 transitions. [2025-03-09 01:38:53,554 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-03-09 01:38:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 223 transitions. [2025-03-09 01:38:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:38:53,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:53,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:38:53,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:38:53,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:53,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:53,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1746200982, now seen corresponding path program 1 times [2025-03-09 01:38:53,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:53,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120978652] [2025-03-09 01:38:53,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:53,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:53,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:38:53,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:38:53,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:53,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:38:53,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:53,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120978652] [2025-03-09 01:38:53,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120978652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:38:53,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557559341] [2025-03-09 01:38:53,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:53,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:53,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:38:53,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:38:53,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:38:53,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:38:53,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:38:53,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:53,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:53,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:38:53,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:38:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:38:53,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:38:53,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557559341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:53,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:38:53,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-09 01:38:53,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715989591] [2025-03-09 01:38:53,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:53,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:38:53,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:53,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:38:53,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:38:53,675 INFO L87 Difference]: Start difference. First operand 170 states and 223 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-03-09 01:38:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:53,738 INFO L93 Difference]: Finished difference Result 186 states and 247 transitions. [2025-03-09 01:38:53,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:38:53,739 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-03-09 01:38:53,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:53,740 INFO L225 Difference]: With dead ends: 186 [2025-03-09 01:38:53,740 INFO L226 Difference]: Without dead ends: 185 [2025-03-09 01:38:53,741 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-03-09 01:38:53,741 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 8 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:53,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 278 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:53,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-09 01:38:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2025-03-09 01:38:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 146 states have (on average 1.404109589041096) internal successors, (205), 155 states have internal predecessors, (205), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:38:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 215 transitions. [2025-03-09 01:38:53,750 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 215 transitions. Word has length 15 [2025-03-09 01:38:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:53,750 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 215 transitions. [2025-03-09 01:38:53,750 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-03-09 01:38:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 215 transitions. [2025-03-09 01:38:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:38:53,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:53,751 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:38:53,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:38:53,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:53,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:53,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1777011643, now seen corresponding path program 1 times [2025-03-09 01:38:53,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:53,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763986222] [2025-03-09 01:38:53,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:53,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:53,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:38:53,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:38:53,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:53,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:38:53,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:53,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763986222] [2025-03-09 01:38:53,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763986222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:53,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:53,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:38:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87861491] [2025-03-09 01:38:53,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:53,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:38:53,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:53,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:38:53,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:38:53,990 INFO L87 Difference]: Start difference. First operand 165 states and 215 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-03-09 01:38:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:54,066 INFO L93 Difference]: Finished difference Result 182 states and 237 transitions. [2025-03-09 01:38:54,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:38:54,066 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-03-09 01:38:54,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:54,069 INFO L225 Difference]: With dead ends: 182 [2025-03-09 01:38:54,069 INFO L226 Difference]: Without dead ends: 180 [2025-03-09 01:38:54,069 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-03-09 01:38:54,070 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 127 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:54,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 282 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-09 01:38:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 155. [2025-03-09 01:38:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 138 states have (on average 1.3985507246376812) internal successors, (193), 145 states have internal predecessors, (193), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:38:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 203 transitions. [2025-03-09 01:38:54,078 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 203 transitions. Word has length 23 [2025-03-09 01:38:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:54,079 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 203 transitions. [2025-03-09 01:38:54,079 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-03-09 01:38:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2025-03-09 01:38:54,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:38:54,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:54,080 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:38:54,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:38:54,080 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:54,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:54,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1777051426, now seen corresponding path program 1 times [2025-03-09 01:38:54,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:54,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227912689] [2025-03-09 01:38:54,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:54,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:54,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:38:54,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:38:54,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:54,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:38:54,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:54,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227912689] [2025-03-09 01:38:54,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227912689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:54,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:54,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:38:54,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012005967] [2025-03-09 01:38:54,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:54,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:38:54,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:54,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:38:54,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:38:54,134 INFO L87 Difference]: Start difference. First operand 155 states and 203 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-03-09 01:38:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:54,207 INFO L93 Difference]: Finished difference Result 178 states and 233 transitions. [2025-03-09 01:38:54,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:38:54,207 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-03-09 01:38:54,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:54,208 INFO L225 Difference]: With dead ends: 178 [2025-03-09 01:38:54,209 INFO L226 Difference]: Without dead ends: 176 [2025-03-09 01:38:54,209 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-03-09 01:38:54,210 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 121 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:54,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 284 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-09 01:38:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 146. [2025-03-09 01:38:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.3893129770992367) internal successors, (182), 136 states have internal predecessors, (182), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:38:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 192 transitions. [2025-03-09 01:38:54,218 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 192 transitions. Word has length 23 [2025-03-09 01:38:54,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:54,218 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 192 transitions. [2025-03-09 01:38:54,218 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-03-09 01:38:54,218 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2025-03-09 01:38:54,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 01:38:54,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:54,220 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-03-09 01:38:54,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:38:54,220 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:54,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:54,220 INFO L85 PathProgramCache]: Analyzing trace with hash 849764923, now seen corresponding path program 1 times [2025-03-09 01:38:54,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:54,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980326773] [2025-03-09 01:38:54,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:54,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:54,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:38:54,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:38:54,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:54,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:38:54,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:54,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980326773] [2025-03-09 01:38:54,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980326773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:38:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172479056] [2025-03-09 01:38:54,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:54,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:54,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:38:54,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:38:54,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:38:54,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:38:54,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:38:54,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:54,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:54,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:38:54,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:38:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:38:54,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:38:54,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172479056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:54,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:38:54,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-03-09 01:38:54,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043928439] [2025-03-09 01:38:54,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:54,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:38:54,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:54,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:38:54,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:38:54,483 INFO L87 Difference]: Start difference. First operand 146 states and 192 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:38:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:54,531 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2025-03-09 01:38:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:38:54,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-03-09 01:38:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:54,533 INFO L225 Difference]: With dead ends: 146 [2025-03-09 01:38:54,533 INFO L226 Difference]: Without dead ends: 145 [2025-03-09 01:38:54,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:38:54,534 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:54,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 350 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:38:54,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-09 01:38:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-09 01:38:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 131 states have (on average 1.381679389312977) internal successors, (181), 135 states have internal predecessors, (181), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:38:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 191 transitions. [2025-03-09 01:38:54,540 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 191 transitions. Word has length 42 [2025-03-09 01:38:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:54,540 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 191 transitions. [2025-03-09 01:38:54,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:38:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 191 transitions. [2025-03-09 01:38:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-09 01:38:54,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:54,541 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, 1] [2025-03-09 01:38:54,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:38:54,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:54,742 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:54,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:54,742 INFO L85 PathProgramCache]: Analyzing trace with hash 572908937, now seen corresponding path program 1 times [2025-03-09 01:38:54,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:54,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101780352] [2025-03-09 01:38:54,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:54,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:54,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 01:38:54,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:38:54,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:54,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:38:54,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101780352] [2025-03-09 01:38:54,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101780352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:38:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699541633] [2025-03-09 01:38:54,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:54,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:54,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:38:54,886 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:38:54,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:38:54,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 01:38:54,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:38:54,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:54,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:54,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:38:54,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:38:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:38:54,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:38:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:38:55,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699541633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:38:55,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:38:55,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-09 01:38:55,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600051167] [2025-03-09 01:38:55,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:38:55,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:38:55,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:55,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:38:55,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:38:55,074 INFO L87 Difference]: Start difference. First operand 145 states and 191 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-09 01:38:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:55,193 INFO L93 Difference]: Finished difference Result 214 states and 276 transitions. [2025-03-09 01:38:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:38:55,194 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 43 [2025-03-09 01:38:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:55,195 INFO L225 Difference]: With dead ends: 214 [2025-03-09 01:38:55,195 INFO L226 Difference]: Without dead ends: 151 [2025-03-09 01:38:55,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:38:55,196 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 11 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:55,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 880 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-09 01:38:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2025-03-09 01:38:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 131 states have (on average 1.366412213740458) internal successors, (179), 135 states have internal predecessors, (179), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:38:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 189 transitions. [2025-03-09 01:38:55,204 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 189 transitions. Word has length 43 [2025-03-09 01:38:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:55,204 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 189 transitions. [2025-03-09 01:38:55,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-09 01:38:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2025-03-09 01:38:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 01:38:55,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:55,205 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:38:55,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:38:55,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-09 01:38:55,405 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:55,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1195914293, now seen corresponding path program 1 times [2025-03-09 01:38:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:55,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843189754] [2025-03-09 01:38:55,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:55,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:55,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 01:38:55,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 01:38:55,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:55,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:38:55,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:55,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843189754] [2025-03-09 01:38:55,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843189754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:38:55,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443377090] [2025-03-09 01:38:55,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:55,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:55,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:38:55,515 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:38:55,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:38:55,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 01:38:55,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 01:38:55,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:55,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:55,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:38:55,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:38:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:38:55,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:38:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:38:55,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443377090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:38:55,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:38:55,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 17 [2025-03-09 01:38:55,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145842649] [2025-03-09 01:38:55,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:38:55,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:38:55,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:55,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:38:55,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:38:55,780 INFO L87 Difference]: Start difference. First operand 145 states and 189 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 states have internal predecessors, (54), 5 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-09 01:38:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:56,004 INFO L93 Difference]: Finished difference Result 281 states and 368 transitions. [2025-03-09 01:38:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:38:56,004 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 states have internal predecessors, (54), 5 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 46 [2025-03-09 01:38:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:56,005 INFO L225 Difference]: With dead ends: 281 [2025-03-09 01:38:56,005 INFO L226 Difference]: Without dead ends: 226 [2025-03-09 01:38:56,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:38:56,006 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 142 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:56,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 942 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-09 01:38:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 164. [2025-03-09 01:38:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 149 states have internal predecessors, (193), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-09 01:38:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 212 transitions. [2025-03-09 01:38:56,014 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 212 transitions. Word has length 46 [2025-03-09 01:38:56,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:56,014 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 212 transitions. [2025-03-09 01:38:56,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 states have internal predecessors, (54), 5 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-09 01:38:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 212 transitions. [2025-03-09 01:38:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 01:38:56,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:56,015 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:38:56,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:38:56,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:56,216 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:56,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:56,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2060547061, now seen corresponding path program 1 times [2025-03-09 01:38:56,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:56,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873290175] [2025-03-09 01:38:56,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:56,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:56,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:38:56,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:38:56,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:56,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:38:56,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:56,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873290175] [2025-03-09 01:38:56,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873290175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:56,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:56,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:38:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501857509] [2025-03-09 01:38:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:56,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:38:56,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:56,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:38:56,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:38:56,323 INFO L87 Difference]: Start difference. First operand 164 states and 212 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:38:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:56,378 INFO L93 Difference]: Finished difference Result 228 states and 290 transitions. [2025-03-09 01:38:56,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:38:56,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-03-09 01:38:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:56,380 INFO L225 Difference]: With dead ends: 228 [2025-03-09 01:38:56,380 INFO L226 Difference]: Without dead ends: 164 [2025-03-09 01:38:56,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:38:56,380 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 7 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:56,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 534 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:38:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-09 01:38:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-09 01:38:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 145 states have (on average 1.3172413793103448) internal successors, (191), 149 states have internal predecessors, (191), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-09 01:38:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 210 transitions. [2025-03-09 01:38:56,387 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 210 transitions. Word has length 50 [2025-03-09 01:38:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:56,387 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 210 transitions. [2025-03-09 01:38:56,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:38:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 210 transitions. [2025-03-09 01:38:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 01:38:56,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:56,388 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] [2025-03-09 01:38:56,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:38:56,388 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:56,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash 688120339, now seen corresponding path program 2 times [2025-03-09 01:38:56,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:56,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295978408] [2025-03-09 01:38:56,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:38:56,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:56,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-09 01:38:56,402 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 53 statements. [2025-03-09 01:38:56,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:38:56,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 01:38:56,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:56,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295978408] [2025-03-09 01:38:56,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295978408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:56,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:56,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:38:56,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081204727] [2025-03-09 01:38:56,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:56,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:38:56,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:56,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:38:56,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:38:56,682 INFO L87 Difference]: Start difference. First operand 164 states and 210 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:38:56,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:56,731 INFO L93 Difference]: Finished difference Result 169 states and 216 transitions. [2025-03-09 01:38:56,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:38:56,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-03-09 01:38:56,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:56,732 INFO L225 Difference]: With dead ends: 169 [2025-03-09 01:38:56,732 INFO L226 Difference]: Without dead ends: 165 [2025-03-09 01:38:56,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:38:56,733 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 32 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:56,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 289 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:38:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-09 01:38:56,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-09 01:38:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 149 states have internal predecessors, (191), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-09 01:38:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2025-03-09 01:38:56,742 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 53 [2025-03-09 01:38:56,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:56,742 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2025-03-09 01:38:56,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:38:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2025-03-09 01:38:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-09 01:38:56,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:56,744 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, 1, 1, 1, 1, 1] [2025-03-09 01:38:56,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:38:56,744 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:56,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:56,744 INFO L85 PathProgramCache]: Analyzing trace with hash 496884711, now seen corresponding path program 1 times [2025-03-09 01:38:56,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:56,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182385149] [2025-03-09 01:38:56,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:56,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:56,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 01:38:56,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 01:38:56,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:56,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 01:38:56,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:56,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182385149] [2025-03-09 01:38:56,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182385149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:56,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:56,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:38:56,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711664376] [2025-03-09 01:38:56,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:56,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:38:56,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:56,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:38:56,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:38:56,812 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:38:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:56,833 INFO L93 Difference]: Finished difference Result 165 states and 212 transitions. [2025-03-09 01:38:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:38:56,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2025-03-09 01:38:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:56,834 INFO L225 Difference]: With dead ends: 165 [2025-03-09 01:38:56,835 INFO L226 Difference]: Without dead ends: 160 [2025-03-09 01:38:56,836 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-03-09 01:38:56,836 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 16 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:56,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 148 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:38:56,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-09 01:38:56,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-09 01:38:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-09 01:38:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2025-03-09 01:38:56,848 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 61 [2025-03-09 01:38:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:56,849 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2025-03-09 01:38:56,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:38:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2025-03-09 01:38:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-09 01:38:56,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:56,850 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] [2025-03-09 01:38:56,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:38:56,850 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:56,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:56,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2086446662, now seen corresponding path program 1 times [2025-03-09 01:38:56,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:56,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410891279] [2025-03-09 01:38:56,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:56,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:56,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 01:38:56,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 01:38:56,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:56,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:38:56,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:56,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410891279] [2025-03-09 01:38:56,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410891279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:56,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:56,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:38:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512665373] [2025-03-09 01:38:56,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:56,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:38:56,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:56,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:38:56,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:38:56,993 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:38:57,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:57,087 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2025-03-09 01:38:57,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:38:57,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 70 [2025-03-09 01:38:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:57,088 INFO L225 Difference]: With dead ends: 203 [2025-03-09 01:38:57,088 INFO L226 Difference]: Without dead ends: 190 [2025-03-09 01:38:57,088 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-03-09 01:38:57,089 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 26 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:57,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 550 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:57,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-09 01:38:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2025-03-09 01:38:57,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 157 states have (on average 1.2738853503184713) internal successors, (200), 157 states have internal predecessors, (200), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-09 01:38:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 221 transitions. [2025-03-09 01:38:57,096 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 221 transitions. Word has length 70 [2025-03-09 01:38:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:57,097 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 221 transitions. [2025-03-09 01:38:57,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:38:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 221 transitions. [2025-03-09 01:38:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-09 01:38:57,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:57,098 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] [2025-03-09 01:38:57,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:38:57,098 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:57,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:57,099 INFO L85 PathProgramCache]: Analyzing trace with hash -52313858, now seen corresponding path program 1 times [2025-03-09 01:38:57,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:57,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240889597] [2025-03-09 01:38:57,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:57,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:57,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 01:38:57,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 01:38:57,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:57,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:38:57,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:57,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240889597] [2025-03-09 01:38:57,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240889597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:38:57,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411370697] [2025-03-09 01:38:57,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:57,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:57,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:38:57,219 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:38:57,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:38:57,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 01:38:57,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 01:38:57,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:57,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:57,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:38:57,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:38:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:38:57,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:38:57,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411370697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:57,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:38:57,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 10 [2025-03-09 01:38:57,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116724167] [2025-03-09 01:38:57,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:57,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:38:57,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:57,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:38:57,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:38:57,356 INFO L87 Difference]: Start difference. First operand 173 states and 221 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:38:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:57,482 INFO L93 Difference]: Finished difference Result 351 states and 438 transitions. [2025-03-09 01:38:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:38:57,482 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 71 [2025-03-09 01:38:57,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:57,483 INFO L225 Difference]: With dead ends: 351 [2025-03-09 01:38:57,483 INFO L226 Difference]: Without dead ends: 299 [2025-03-09 01:38:57,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:38:57,484 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 136 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:57,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 537 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-09 01:38:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 190. [2025-03-09 01:38:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.2616279069767442) internal successors, (217), 171 states have internal predecessors, (217), 10 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (17), 14 states have call predecessors, (17), 10 states have call successors, (17) [2025-03-09 01:38:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 244 transitions. [2025-03-09 01:38:57,495 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 244 transitions. Word has length 71 [2025-03-09 01:38:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:57,496 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 244 transitions. [2025-03-09 01:38:57,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:38:57,497 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 244 transitions. [2025-03-09 01:38:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-09 01:38:57,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:57,498 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] [2025-03-09 01:38:57,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:38:57,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:57,702 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:57,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:57,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1673167039, now seen corresponding path program 1 times [2025-03-09 01:38:57,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:57,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134288145] [2025-03-09 01:38:57,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:57,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:57,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 01:38:57,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 01:38:57,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:57,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:38:57,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:57,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134288145] [2025-03-09 01:38:57,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134288145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:38:57,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147408768] [2025-03-09 01:38:57,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:57,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:57,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:38:57,930 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:38:57,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:38:57,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 01:38:58,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 01:38:58,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:58,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:58,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 01:38:58,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:38:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:38:58,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:38:58,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147408768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:58,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:38:58,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 13 [2025-03-09 01:38:58,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252507924] [2025-03-09 01:38:58,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:58,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:38:58,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:58,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:38:58,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:38:58,127 INFO L87 Difference]: Start difference. First operand 190 states and 244 transitions. Second operand has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 01:38:58,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:58,318 INFO L93 Difference]: Finished difference Result 333 states and 417 transitions. [2025-03-09 01:38:58,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:38:58,319 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 71 [2025-03-09 01:38:58,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:58,320 INFO L225 Difference]: With dead ends: 333 [2025-03-09 01:38:58,320 INFO L226 Difference]: Without dead ends: 172 [2025-03-09 01:38:58,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:38:58,320 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 150 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:58,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 780 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:58,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-09 01:38:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 166. [2025-03-09 01:38:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 152 states have (on average 1.2763157894736843) internal successors, (194), 152 states have internal predecessors, (194), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-09 01:38:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 211 transitions. [2025-03-09 01:38:58,330 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 211 transitions. Word has length 71 [2025-03-09 01:38:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:58,330 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 211 transitions. [2025-03-09 01:38:58,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 01:38:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2025-03-09 01:38:58,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 01:38:58,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:58,332 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, 1, 1, 1, 1] [2025-03-09 01:38:58,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:38:58,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:58,533 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:58,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:58,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1832232313, now seen corresponding path program 1 times [2025-03-09 01:38:58,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:58,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861111008] [2025-03-09 01:38:58,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:58,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:58,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 01:38:58,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 01:38:58,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:58,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:38:58,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:58,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861111008] [2025-03-09 01:38:58,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861111008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:38:58,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997441163] [2025-03-09 01:38:58,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:58,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:58,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:38:58,568 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:38:58,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:38:58,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 01:38:58,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 01:38:58,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:58,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:58,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 01:38:58,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:38:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:38:58,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:38:58,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997441163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:58,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:38:58,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-09 01:38:58,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318288370] [2025-03-09 01:38:58,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:58,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:38:58,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:58,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:38:58,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:38:58,639 INFO L87 Difference]: Start difference. First operand 166 states and 211 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 01:38:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:58,676 INFO L93 Difference]: Finished difference Result 314 states and 400 transitions. [2025-03-09 01:38:58,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:38:58,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-09 01:38:58,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:58,678 INFO L225 Difference]: With dead ends: 314 [2025-03-09 01:38:58,678 INFO L226 Difference]: Without dead ends: 177 [2025-03-09 01:38:58,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:38:58,679 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:58,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 164 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:38:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-09 01:38:58,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2025-03-09 01:38:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 157 states have internal predecessors, (198), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-09 01:38:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 215 transitions. [2025-03-09 01:38:58,687 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 215 transitions. Word has length 77 [2025-03-09 01:38:58,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:58,688 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 215 transitions. [2025-03-09 01:38:58,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 01:38:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 215 transitions. [2025-03-09 01:38:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 01:38:58,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:58,689 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, 1, 1, 1, 1, 1] [2025-03-09 01:38:58,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:38:58,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:38:58,889 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:58,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:58,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1974535394, now seen corresponding path program 1 times [2025-03-09 01:38:58,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:58,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895212234] [2025-03-09 01:38:58,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:58,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:58,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 01:38:58,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 01:38:58,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:58,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:38:59,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:59,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895212234] [2025-03-09 01:38:59,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895212234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:59,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:59,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:38:59,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117224266] [2025-03-09 01:38:59,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:59,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:38:59,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:59,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:38:59,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:38:59,104 INFO L87 Difference]: Start difference. First operand 171 states and 215 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 01:38:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:59,263 INFO L93 Difference]: Finished difference Result 322 states and 396 transitions. [2025-03-09 01:38:59,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:38:59,263 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-09 01:38:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:59,265 INFO L225 Difference]: With dead ends: 322 [2025-03-09 01:38:59,265 INFO L226 Difference]: Without dead ends: 270 [2025-03-09 01:38:59,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:38:59,266 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 97 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:59,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 916 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:38:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-09 01:38:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 190. [2025-03-09 01:38:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 174 states have internal predecessors, (220), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-09 01:38:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 239 transitions. [2025-03-09 01:38:59,274 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 239 transitions. Word has length 78 [2025-03-09 01:38:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:59,275 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 239 transitions. [2025-03-09 01:38:59,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 01:38:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 239 transitions. [2025-03-09 01:38:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 01:38:59,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:38:59,276 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, 1, 1, 1, 1, 1] [2025-03-09 01:38:59,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:38:59,276 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:38:59,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:38:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash -594951005, now seen corresponding path program 1 times [2025-03-09 01:38:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:38:59,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188839051] [2025-03-09 01:38:59,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:38:59,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:38:59,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 01:38:59,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 01:38:59,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:38:59,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:38:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:38:59,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:38:59,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188839051] [2025-03-09 01:38:59,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188839051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:38:59,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:38:59,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 01:38:59,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891457438] [2025-03-09 01:38:59,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:38:59,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:38:59,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:38:59,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:38:59,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:38:59,648 INFO L87 Difference]: Start difference. First operand 190 states and 239 transitions. Second operand has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:38:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:38:59,933 INFO L93 Difference]: Finished difference Result 255 states and 318 transitions. [2025-03-09 01:38:59,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:38:59,933 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 78 [2025-03-09 01:38:59,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:38:59,934 INFO L225 Difference]: With dead ends: 255 [2025-03-09 01:38:59,934 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:38:59,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:38:59,935 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 109 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:38:59,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 876 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:38:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:38:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:38:59,935 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-03-09 01:38:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:38:59,935 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2025-03-09 01:38:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:38:59,935 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:38:59,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:38:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:38:59,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:38:59,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-03-09 01:38:59,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-09 01:38:59,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-09 01:38:59,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-03-09 01:38:59,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-09 01:38:59,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-09 01:38:59,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-09 01:38:59,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-09 01:38:59,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-09 01:38:59,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-09 01:38:59,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-09 01:38:59,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-09 01:38:59,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-09 01:38:59,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-09 01:38:59,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-09 01:38:59,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-09 01:38:59,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 01:38:59,942 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] [2025-03-09 01:38:59,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:39:00,874 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:39:00,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:39:00 BoogieIcfgContainer [2025-03-09 01:39:00,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:39:00,895 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:39:00,895 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:39:00,895 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:39:00,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:38:51" (3/4) ... [2025-03-09 01:39:00,897 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:39:00,902 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure base2flt [2025-03-09 01:39:00,902 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 01:39:00,908 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-09 01:39:00,909 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 01:39:00,909 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:39:00,909 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:39:00,930 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-03-09 01:39:00,931 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-03-09 01:39:00,954 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-03-09 01:39:00,954 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-03-09 01:39:00,985 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:39:00,985 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:39:00,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:39:00,987 INFO L158 Benchmark]: Toolchain (without parser) took 10199.44ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 132.7MB in the beginning and 119.3MB in the end (delta: 13.4MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2025-03-09 01:39:00,987 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:39:00,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.80ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 118.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:39:00,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.07ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 116.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:39:00,989 INFO L158 Benchmark]: Boogie Preprocessor took 30.63ms. Allocated memory is still 167.8MB. Free memory was 116.5MB in the beginning and 114.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:39:00,989 INFO L158 Benchmark]: IcfgBuilder took 437.45ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 87.5MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:39:00,989 INFO L158 Benchmark]: TraceAbstraction took 9344.76ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 87.0MB in the beginning and 124.8MB in the end (delta: -37.8MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. [2025-03-09 01:39:00,989 INFO L158 Benchmark]: Witness Printer took 91.12ms. Allocated memory is still 251.7MB. Free memory was 124.8MB in the beginning and 119.3MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:39:00,990 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.80ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 118.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.07ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 116.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.63ms. Allocated memory is still 167.8MB. Free memory was 116.5MB in the beginning and 114.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 437.45ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 87.5MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9344.76ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 87.0MB in the beginning and 124.8MB in the end (delta: -37.8MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. * Witness Printer took 91.12ms. Allocated memory is still 251.7MB. Free memory was 124.8MB in the beginning and 119.3MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 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: 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 - 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: 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: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 184 edges, 16 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1401 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1370 mSDsluCounter, 9833 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7669 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2514 IncrementalHoareTripleChecker+Invalid, 2603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 2164 mSDtfsCounter, 2514 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 645 GetRequests, 482 SyntacticMatches, 3 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=19, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 455 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1297 NumberOfCodeBlocks, 1280 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1352 ConstructedInterpolants, 0 QuantifiedInterpolants, 2547 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1157 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 34 InterpolantComputations, 21 PerfectInterpolantSequences, 367/407 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: 38]: Location Invariant Derived location invariant: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) - InvariantResult [Line: 58]: Location Invariant Derived location invariant: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:39:01,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE