./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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-3a.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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:26:03,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:26:03,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:26:03,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:26:03,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:26:03,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:26:03,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:26:03,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:26:03,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:26:03,376 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:26:03,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:26:03,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:26:03,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:26:03,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:26:03,377 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:26:03,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:26:03,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:26:03,378 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:26:03,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:26:03,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:26:03,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:26:03,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:26:03,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:26:03,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:26:03,379 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:26:03,379 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:26:03,379 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:26:03,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:26:03,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:26:03,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:26:03,379 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:26:03,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:26:03,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:26:03,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:26:03,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:26:03,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:26:03,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:26:03,380 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:26:03,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:26:03,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:26:03,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:26:03,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:26:03,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:26:03,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:26:03,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:26:03,381 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2025-03-04 10:26:03,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:26:03,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:26:03,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:26:03,612 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:26:03,612 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:26:03,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2025-03-04 10:26:04,735 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f192c3958/2fe2e3bb2b204048a586907cef12ceba/FLAG5fc4deed0 [2025-03-04 10:26:05,015 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:26:05,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2025-03-04 10:26:05,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f192c3958/2fe2e3bb2b204048a586907cef12ceba/FLAG5fc4deed0 [2025-03-04 10:26:05,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f192c3958/2fe2e3bb2b204048a586907cef12ceba [2025-03-04 10:26:05,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:26:05,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:26:05,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:26:05,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:26:05,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:26:05,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d34efc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05, skipping insertion in model container [2025-03-04 10:26:05,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:26:05,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:26:05,201 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:26:05,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:26:05,238 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:26:05,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05 WrapperNode [2025-03-04 10:26:05,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:26:05,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:26:05,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:26:05,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:26:05,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,278 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 206 [2025-03-04 10:26:05,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:26:05,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:26:05,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:26:05,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:26:05,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,308 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-04 10:26:05,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:26:05,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:26:05,330 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:26:05,330 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:26:05,331 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05" (1/1) ... [2025-03-04 10:26:05,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:26:05,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:05,360 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-04 10:26:05,365 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-04 10:26:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:26:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:26:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-04 10:26:05,381 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-04 10:26:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:26:05,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:26:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:26:05,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:26:05,428 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:26:05,430 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:26:05,751 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2025-03-04 10:26:05,751 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:26:05,773 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:26:05,774 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 10:26:05,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:26:05 BoogieIcfgContainer [2025-03-04 10:26:05,775 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:26:05,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:26:05,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:26:05,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:26:05,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:26:05" (1/3) ... [2025-03-04 10:26:05,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307b9983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:26:05, skipping insertion in model container [2025-03-04 10:26:05,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:05" (2/3) ... [2025-03-04 10:26:05,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307b9983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:26:05, skipping insertion in model container [2025-03-04 10:26:05,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:26:05" (3/3) ... [2025-03-04 10:26:05,783 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2025-03-04 10:26:05,793 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:26:05,795 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-3a.c.cil.c that has 3 procedures, 127 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-03-04 10:26:05,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:26:05,844 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;@1ce67e35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:26:05,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-04 10:26:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 99 states have (on average 1.6161616161616161) internal successors, (160), 117 states have internal predecessors, (160), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:26:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:26:05,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:05,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:05,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:05,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:05,861 INFO L85 PathProgramCache]: Analyzing trace with hash -435714627, now seen corresponding path program 1 times [2025-03-04 10:26:05,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:05,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909643011] [2025-03-04 10:26:05,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:05,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:05,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:26:05,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:26:05,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:05,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:06,043 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-04 10:26:06,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:06,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909643011] [2025-03-04 10:26:06,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909643011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:06,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:06,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:06,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837383493] [2025-03-04 10:26:06,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:06,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:06,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:06,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:06,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:06,065 INFO L87 Difference]: Start difference. First operand has 127 states, 99 states have (on average 1.6161616161616161) internal successors, (160), 117 states have internal predecessors, (160), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-04 10:26:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:06,203 INFO L93 Difference]: Finished difference Result 299 states and 439 transitions. [2025-03-04 10:26:06,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:06,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2025-03-04 10:26:06,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:06,209 INFO L225 Difference]: With dead ends: 299 [2025-03-04 10:26:06,210 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 10:26:06,212 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-04 10:26:06,214 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 85 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 445 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-04 10:26:06,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 445 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 10:26:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2025-03-04 10:26:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.4642857142857142) internal successors, (164), 123 states have internal predecessors, (164), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:26:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 176 transitions. [2025-03-04 10:26:06,270 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 176 transitions. Word has length 9 [2025-03-04 10:26:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:06,270 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 176 transitions. [2025-03-04 10:26:06,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-04 10:26:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 176 transitions. [2025-03-04 10:26:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:26:06,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:06,272 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:06,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:26:06,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:06,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:06,273 INFO L85 PathProgramCache]: Analyzing trace with hash -51233632, now seen corresponding path program 1 times [2025-03-04 10:26:06,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:06,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502292769] [2025-03-04 10:26:06,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:06,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:26:06,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:26:06,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:06,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:26:06,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:06,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502292769] [2025-03-04 10:26:06,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502292769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:06,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:06,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:26:06,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446622848] [2025-03-04 10:26:06,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:06,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:06,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:06,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:06,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:06,331 INFO L87 Difference]: Start difference. First operand 133 states and 176 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-04 10:26:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:06,368 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2025-03-04 10:26:06,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:06,369 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-04 10:26:06,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:06,369 INFO L225 Difference]: With dead ends: 133 [2025-03-04 10:26:06,369 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 10:26:06,370 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-04 10:26:06,374 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 191 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-04 10:26:06,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 191 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 10:26:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-04 10:26:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 122 states have internal predecessors, (162), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:26:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 174 transitions. [2025-03-04 10:26:06,382 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 174 transitions. Word has length 14 [2025-03-04 10:26:06,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:06,382 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 174 transitions. [2025-03-04 10:26:06,382 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-04 10:26:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 174 transitions. [2025-03-04 10:26:06,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:26:06,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:06,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:06,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:26:06,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:06,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:06,384 INFO L85 PathProgramCache]: Analyzing trace with hash -51219727, now seen corresponding path program 1 times [2025-03-04 10:26:06,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:06,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457061476] [2025-03-04 10:26:06,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:06,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:06,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:26:06,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:26:06,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:06,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:06,424 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-04 10:26:06,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:06,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457061476] [2025-03-04 10:26:06,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457061476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:06,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:06,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:06,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516738460] [2025-03-04 10:26:06,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:06,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:06,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:06,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:06,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:06,426 INFO L87 Difference]: Start difference. First operand 132 states and 174 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:26:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:06,464 INFO L93 Difference]: Finished difference Result 247 states and 325 transitions. [2025-03-04 10:26:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:06,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 10:26:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:06,465 INFO L225 Difference]: With dead ends: 247 [2025-03-04 10:26:06,465 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 10:26:06,466 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-04 10:26:06,466 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 192 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-04 10:26:06,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 192 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 10:26:06,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 136. [2025-03-04 10:26:06,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.4310344827586208) internal successors, (166), 126 states have internal predecessors, (166), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:26:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 178 transitions. [2025-03-04 10:26:06,478 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 178 transitions. Word has length 14 [2025-03-04 10:26:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:06,479 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 178 transitions. [2025-03-04 10:26:06,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:26:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 178 transitions. [2025-03-04 10:26:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:26:06,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:06,479 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:06,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:26:06,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:06,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:06,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1588242600, now seen corresponding path program 1 times [2025-03-04 10:26:06,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:06,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262277763] [2025-03-04 10:26:06,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:06,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:06,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:26:06,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:26:06,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:06,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:06,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:06,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262277763] [2025-03-04 10:26:06,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262277763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:06,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391184350] [2025-03-04 10:26:06,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:06,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:06,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:06,550 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-04 10:26:06,552 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-04 10:26:06,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:26:06,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:26:06,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:06,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:06,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:26:06,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:06,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:06,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391184350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:06,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:06,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 10:26:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332644100] [2025-03-04 10:26:06,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:06,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:06,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:06,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:26:06,629 INFO L87 Difference]: Start difference. First operand 136 states and 178 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-04 10:26:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:06,674 INFO L93 Difference]: Finished difference Result 148 states and 195 transitions. [2025-03-04 10:26:06,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:06,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-04 10:26:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:06,675 INFO L225 Difference]: With dead ends: 148 [2025-03-04 10:26:06,675 INFO L226 Difference]: Without dead ends: 147 [2025-03-04 10:26:06,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-04 10:26:06,676 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 14 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 187 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:06,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 187 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-04 10:26:06,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 138. [2025-03-04 10:26:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.423728813559322) internal successors, (168), 128 states have internal predecessors, (168), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:26:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 180 transitions. [2025-03-04 10:26:06,683 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 180 transitions. Word has length 15 [2025-03-04 10:26:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:06,684 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 180 transitions. [2025-03-04 10:26:06,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-04 10:26:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 180 transitions. [2025-03-04 10:26:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:26:06,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:06,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:06,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:26:06,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:06,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:06,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:06,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1587660618, now seen corresponding path program 1 times [2025-03-04 10:26:06,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:06,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243571782] [2025-03-04 10:26:06,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:06,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:06,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:26:06,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:26:06,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:06,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:06,928 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-04 10:26:06,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:06,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243571782] [2025-03-04 10:26:06,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243571782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:06,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:06,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:06,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84592356] [2025-03-04 10:26:06,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:06,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:06,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:06,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:06,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:06,930 INFO L87 Difference]: Start difference. First operand 138 states and 180 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, (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-04 10:26:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:07,030 INFO L93 Difference]: Finished difference Result 257 states and 328 transitions. [2025-03-04 10:26:07,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:26:07,031 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, (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-04 10:26:07,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:07,032 INFO L225 Difference]: With dead ends: 257 [2025-03-04 10:26:07,032 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 10:26:07,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:26:07,034 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 114 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:07,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 375 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:07,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 10:26:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2025-03-04 10:26:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 128 states have (on average 1.3984375) internal successors, (179), 138 states have internal predecessors, (179), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:26:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2025-03-04 10:26:07,047 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 15 [2025-03-04 10:26:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:07,047 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2025-03-04 10:26:07,047 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, (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-04 10:26:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2025-03-04 10:26:07,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:26:07,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:07,048 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:07,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:26:07,048 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:07,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:07,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1374338879, now seen corresponding path program 1 times [2025-03-04 10:26:07,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:07,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937556509] [2025-03-04 10:26:07,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:07,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:07,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:26:07,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:26:07,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:07,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:07,085 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-04 10:26:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937556509] [2025-03-04 10:26:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937556509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:07,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:07,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750635678] [2025-03-04 10:26:07,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:07,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:07,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:07,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:07,086 INFO L87 Difference]: Start difference. First operand 148 states and 191 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, (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-04 10:26:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:07,164 INFO L93 Difference]: Finished difference Result 209 states and 273 transitions. [2025-03-04 10:26:07,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:07,165 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, (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 17 [2025-03-04 10:26:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:07,167 INFO L225 Difference]: With dead ends: 209 [2025-03-04 10:26:07,167 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 10:26:07,167 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-04 10:26:07,167 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 133 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:07,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 301 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:07,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 10:26:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 184. [2025-03-04 10:26:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 164 states have (on average 1.4024390243902438) internal successors, (230), 173 states have internal predecessors, (230), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:26:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 242 transitions. [2025-03-04 10:26:07,186 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 242 transitions. Word has length 17 [2025-03-04 10:26:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:07,186 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 242 transitions. [2025-03-04 10:26:07,186 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, (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-04 10:26:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 242 transitions. [2025-03-04 10:26:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:26:07,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:07,187 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:07,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:26:07,187 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:07,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1375630877, now seen corresponding path program 1 times [2025-03-04 10:26:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:07,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124039686] [2025-03-04 10:26:07,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:07,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:26:07,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:26:07,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:07,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:07,248 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-04 10:26:07,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:07,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124039686] [2025-03-04 10:26:07,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124039686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:07,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:07,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:07,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779577866] [2025-03-04 10:26:07,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:07,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:07,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:07,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:07,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:07,250 INFO L87 Difference]: Start difference. First operand 184 states and 242 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, (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-04 10:26:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:07,340 INFO L93 Difference]: Finished difference Result 208 states and 269 transitions. [2025-03-04 10:26:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:07,341 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, (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 17 [2025-03-04 10:26:07,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:07,342 INFO L225 Difference]: With dead ends: 208 [2025-03-04 10:26:07,344 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 10:26:07,344 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-04 10:26:07,345 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 128 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 301 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-04 10:26:07,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 301 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:07,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 10:26:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2025-03-04 10:26:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 169 states have (on average 1.3846153846153846) internal successors, (234), 178 states have internal predecessors, (234), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:26:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 246 transitions. [2025-03-04 10:26:07,358 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 246 transitions. Word has length 17 [2025-03-04 10:26:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:07,358 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 246 transitions. [2025-03-04 10:26:07,358 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, (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-04 10:26:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 246 transitions. [2025-03-04 10:26:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:26:07,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:07,360 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:07,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:26:07,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:07,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2081946084, now seen corresponding path program 1 times [2025-03-04 10:26:07,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:07,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597743091] [2025-03-04 10:26:07,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:07,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:07,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:26:07,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:26:07,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:07,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:07,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:07,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597743091] [2025-03-04 10:26:07,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597743091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:07,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404429074] [2025-03-04 10:26:07,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:07,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:07,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:07,426 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-04 10:26:07,427 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-04 10:26:07,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:26:07,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:26:07,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:07,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:07,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:26:07,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:07,479 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-04 10:26:07,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:07,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404429074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:07,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:07,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 10:26:07,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654773845] [2025-03-04 10:26:07,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:07,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:07,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:07,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:26:07,481 INFO L87 Difference]: Start difference. First operand 189 states and 246 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-04 10:26:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:07,537 INFO L93 Difference]: Finished difference Result 206 states and 273 transitions. [2025-03-04 10:26:07,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:07,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 17 [2025-03-04 10:26:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:07,539 INFO L225 Difference]: With dead ends: 206 [2025-03-04 10:26:07,539 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 10:26:07,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-04 10:26:07,539 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 8 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:07,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 289 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 10:26:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 184. [2025-03-04 10:26:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 164 states have (on average 1.3841463414634145) internal successors, (227), 173 states have internal predecessors, (227), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:26:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 239 transitions. [2025-03-04 10:26:07,547 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 239 transitions. Word has length 17 [2025-03-04 10:26:07,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:07,547 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 239 transitions. [2025-03-04 10:26:07,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-04 10:26:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 239 transitions. [2025-03-04 10:26:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:26:07,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:07,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:07,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:07,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 10:26:07,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:07,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:07,752 INFO L85 PathProgramCache]: Analyzing trace with hash -150013607, now seen corresponding path program 1 times [2025-03-04 10:26:07,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:07,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118244956] [2025-03-04 10:26:07,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:07,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:07,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:26:07,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:26:07,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:07,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:26:07,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:07,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118244956] [2025-03-04 10:26:07,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118244956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:07,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:07,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:07,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088176044] [2025-03-04 10:26:07,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:07,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:07,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:07,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:07,790 INFO L87 Difference]: Start difference. First operand 184 states and 239 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-04 10:26:07,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:07,832 INFO L93 Difference]: Finished difference Result 208 states and 273 transitions. [2025-03-04 10:26:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:07,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 20 [2025-03-04 10:26:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:07,834 INFO L225 Difference]: With dead ends: 208 [2025-03-04 10:26:07,835 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 10:26:07,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:07,835 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:07,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 199 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 10:26:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 179. [2025-03-04 10:26:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 159 states have (on average 1.3773584905660377) internal successors, (219), 168 states have internal predecessors, (219), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:26:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2025-03-04 10:26:07,844 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 20 [2025-03-04 10:26:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:07,845 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2025-03-04 10:26:07,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-04 10:26:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2025-03-04 10:26:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:26:07,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:07,846 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:07,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:26:07,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:07,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:07,846 INFO L85 PathProgramCache]: Analyzing trace with hash -526909603, now seen corresponding path program 1 times [2025-03-04 10:26:07,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:07,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886595702] [2025-03-04 10:26:07,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:07,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:07,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:26:07,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:26:07,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:07,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:07,889 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-04 10:26:07,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:07,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886595702] [2025-03-04 10:26:07,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886595702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:07,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:07,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:07,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624865836] [2025-03-04 10:26:07,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:07,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:07,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:07,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:07,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:07,890 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-04 10:26:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:07,960 INFO L93 Difference]: Finished difference Result 197 states and 255 transitions. [2025-03-04 10:26:07,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:07,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 24 [2025-03-04 10:26:07,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:07,962 INFO L225 Difference]: With dead ends: 197 [2025-03-04 10:26:07,962 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 10:26:07,962 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-04 10:26:07,962 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 131 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:07,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 298 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:07,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 10:26:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 168. [2025-03-04 10:26:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 150 states have (on average 1.3666666666666667) internal successors, (205), 157 states have internal predecessors, (205), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:26:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 217 transitions. [2025-03-04 10:26:07,970 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 217 transitions. Word has length 24 [2025-03-04 10:26:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:07,970 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 217 transitions. [2025-03-04 10:26:07,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-04 10:26:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 217 transitions. [2025-03-04 10:26:07,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:26:07,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:07,971 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:07,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:26:07,971 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:07,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:07,971 INFO L85 PathProgramCache]: Analyzing trace with hash -525617605, now seen corresponding path program 1 times [2025-03-04 10:26:07,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:07,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245883330] [2025-03-04 10:26:07,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:07,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:07,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:26:07,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:26:07,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:07,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,015 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-04 10:26:08,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245883330] [2025-03-04 10:26:08,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245883330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:08,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:08,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915769742] [2025-03-04 10:26:08,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:08,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:08,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:08,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:08,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:08,017 INFO L87 Difference]: Start difference. First operand 168 states and 217 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-04 10:26:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:08,086 INFO L93 Difference]: Finished difference Result 188 states and 243 transitions. [2025-03-04 10:26:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:08,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 24 [2025-03-04 10:26:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:08,087 INFO L225 Difference]: With dead ends: 188 [2025-03-04 10:26:08,087 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 10:26:08,087 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-04 10:26:08,088 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 124 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:08,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 300 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 10:26:08,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 161. [2025-03-04 10:26:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 145 states have (on average 1.3586206896551725) internal successors, (197), 150 states have internal predecessors, (197), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:26:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 209 transitions. [2025-03-04 10:26:08,095 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 209 transitions. Word has length 24 [2025-03-04 10:26:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:08,095 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 209 transitions. [2025-03-04 10:26:08,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-04 10:26:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 209 transitions. [2025-03-04 10:26:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 10:26:08,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:08,096 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-04 10:26:08,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:26:08,097 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:08,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1663514261, now seen corresponding path program 1 times [2025-03-04 10:26:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629416619] [2025-03-04 10:26:08,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:08,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:26:08,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:26:08,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,240 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-04 10:26:08,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:08,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629416619] [2025-03-04 10:26:08,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629416619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:08,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276750526] [2025-03-04 10:26:08,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:08,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:08,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:08,243 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-04 10:26:08,244 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-04 10:26:08,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:26:08,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:26:08,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:26:08,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:08,319 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-04 10:26:08,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:08,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276750526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:08,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:08,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-03-04 10:26:08,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968197143] [2025-03-04 10:26:08,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:08,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:08,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:08,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:08,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:26:08,321 INFO L87 Difference]: Start difference. First operand 161 states and 209 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-04 10:26:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:08,376 INFO L93 Difference]: Finished difference Result 161 states and 209 transitions. [2025-03-04 10:26:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:26:08,376 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-04 10:26:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:08,377 INFO L225 Difference]: With dead ends: 161 [2025-03-04 10:26:08,378 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 10:26:08,379 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-04 10:26:08,379 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:08,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 356 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:08,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 10:26:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-04 10:26:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.3517241379310345) internal successors, (196), 149 states have internal predecessors, (196), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:26:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 208 transitions. [2025-03-04 10:26:08,398 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 208 transitions. Word has length 42 [2025-03-04 10:26:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:08,398 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 208 transitions. [2025-03-04 10:26:08,398 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-04 10:26:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 208 transitions. [2025-03-04 10:26:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 10:26:08,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:08,400 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-04 10:26:08,411 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-04 10:26:08,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:08,601 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:08,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash 29334640, now seen corresponding path program 1 times [2025-03-04 10:26:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:08,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399413815] [2025-03-04 10:26:08,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:08,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:26:08,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:26:08,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,735 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-04 10:26:08,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:08,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399413815] [2025-03-04 10:26:08,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399413815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:08,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036873772] [2025-03-04 10:26:08,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:08,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:08,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:08,737 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-04 10:26:08,739 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-04 10:26:08,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:26:08,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:26:08,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:26:08,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:08,804 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-04 10:26:08,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:08,902 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-04 10:26:08,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036873772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:08,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:08,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 10:26:08,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324850566] [2025-03-04 10:26:08,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:08,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:26:08,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:08,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:26:08,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:26:08,903 INFO L87 Difference]: Start difference. First operand 160 states and 208 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-04 10:26:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:09,028 INFO L93 Difference]: Finished difference Result 229 states and 294 transitions. [2025-03-04 10:26:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:26:09,028 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-04 10:26:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:09,029 INFO L225 Difference]: With dead ends: 229 [2025-03-04 10:26:09,030 INFO L226 Difference]: Without dead ends: 166 [2025-03-04 10:26:09,030 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-04 10:26:09,031 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 11 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:09,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1003 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-04 10:26:09,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2025-03-04 10:26:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 149 states have internal predecessors, (194), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:26:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 206 transitions. [2025-03-04 10:26:09,046 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 206 transitions. Word has length 43 [2025-03-04 10:26:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:09,046 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 206 transitions. [2025-03-04 10:26:09,047 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-04 10:26:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 206 transitions. [2025-03-04 10:26:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 10:26:09,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:09,047 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] [2025-03-04 10:26:09,054 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-04 10:26:09,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:09,252 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:09,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash 74043125, now seen corresponding path program 1 times [2025-03-04 10:26:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:09,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752870080] [2025-03-04 10:26:09,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:09,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:09,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:26:09,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:26:09,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:09,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:09,356 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-04 10:26:09,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:09,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752870080] [2025-03-04 10:26:09,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752870080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:09,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396005926] [2025-03-04 10:26:09,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:09,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:09,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:09,359 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-04 10:26:09,361 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-04 10:26:09,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:26:09,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:26:09,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:09,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:09,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:26:09,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:09,445 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-04 10:26:09,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:09,631 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-04 10:26:09,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396005926] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:09,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:09,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 17 [2025-03-04 10:26:09,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667232825] [2025-03-04 10:26:09,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:09,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:26:09,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:09,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:26:09,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:26:09,633 INFO L87 Difference]: Start difference. First operand 160 states and 206 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 14 states have internal predecessors, (55), 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-04 10:26:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:09,912 INFO L93 Difference]: Finished difference Result 296 states and 387 transitions. [2025-03-04 10:26:09,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:26:09,913 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 14 states have internal predecessors, (55), 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 47 [2025-03-04 10:26:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:09,914 INFO L225 Difference]: With dead ends: 296 [2025-03-04 10:26:09,914 INFO L226 Difference]: Without dead ends: 241 [2025-03-04 10:26:09,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 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-04 10:26:09,915 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 140 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:09,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1254 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:26:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-04 10:26:09,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 179. [2025-03-04 10:26:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 163 states have internal predecessors, (208), 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-04 10:26:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 229 transitions. [2025-03-04 10:26:09,923 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 229 transitions. Word has length 47 [2025-03-04 10:26:09,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:09,923 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 229 transitions. [2025-03-04 10:26:09,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 14 states have internal predecessors, (55), 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-04 10:26:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 229 transitions. [2025-03-04 10:26:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:26:09,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:09,924 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, 1] [2025-03-04 10:26:09,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:26:10,128 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,SelfDestructingSolverStorable13 [2025-03-04 10:26:10,128 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:10,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,128 INFO L85 PathProgramCache]: Analyzing trace with hash 442419445, now seen corresponding path program 1 times [2025-03-04 10:26:10,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379998099] [2025-03-04 10:26:10,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:26:10,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:26:10,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,229 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-04 10:26:10,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379998099] [2025-03-04 10:26:10,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379998099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:26:10,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448850443] [2025-03-04 10:26:10,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:26:10,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:26:10,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:26:10,231 INFO L87 Difference]: Start difference. First operand 179 states and 229 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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-04 10:26:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,292 INFO L93 Difference]: Finished difference Result 243 states and 308 transitions. [2025-03-04 10:26:10,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:26:10,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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 51 [2025-03-04 10:26:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,293 INFO L225 Difference]: With dead ends: 243 [2025-03-04 10:26:10,293 INFO L226 Difference]: Without dead ends: 179 [2025-03-04 10:26:10,293 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-04 10:26:10,294 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 7 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 552 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-04 10:26:10,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 552 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:10,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-04 10:26:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-04 10:26:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 159 states have (on average 1.2955974842767295) internal successors, (206), 163 states have internal predecessors, (206), 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-04 10:26:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 227 transitions. [2025-03-04 10:26:10,302 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 227 transitions. Word has length 51 [2025-03-04 10:26:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,302 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 227 transitions. [2025-03-04 10:26:10,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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-04 10:26:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 227 transitions. [2025-03-04 10:26:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 10:26:10,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,303 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] [2025-03-04 10:26:10,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:26:10,304 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:10,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1390493424, now seen corresponding path program 2 times [2025-03-04 10:26:10,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801996863] [2025-03-04 10:26:10,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:26:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-04 10:26:10,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 55 statements. [2025-03-04 10:26:10,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:26:10,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:26:10,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801996863] [2025-03-04 10:26:10,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801996863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:10,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706804643] [2025-03-04 10:26:10,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:10,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:10,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:10,559 INFO L87 Difference]: Start difference. First operand 179 states and 227 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (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-04 10:26:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,610 INFO L93 Difference]: Finished difference Result 184 states and 233 transitions. [2025-03-04 10:26:10,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:10,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (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 55 [2025-03-04 10:26:10,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,611 INFO L225 Difference]: With dead ends: 184 [2025-03-04 10:26:10,611 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 10:26:10,611 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-04 10:26:10,612 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 31 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:10,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 300 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:10,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 10:26:10,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-04 10:26:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.279503105590062) internal successors, (206), 163 states have internal predecessors, (206), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-04 10:26:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 229 transitions. [2025-03-04 10:26:10,623 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 229 transitions. Word has length 55 [2025-03-04 10:26:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,624 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 229 transitions. [2025-03-04 10:26:10,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (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-04 10:26:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 229 transitions. [2025-03-04 10:26:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 10:26:10,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,625 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:10,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:26:10,625 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:10,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,626 INFO L85 PathProgramCache]: Analyzing trace with hash 401506903, now seen corresponding path program 1 times [2025-03-04 10:26:10,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539346121] [2025-03-04 10:26:10,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 10:26:10,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 10:26:10,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 10:26:10,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539346121] [2025-03-04 10:26:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539346121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:26:10,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442900959] [2025-03-04 10:26:10,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:10,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:10,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:10,710 INFO L87 Difference]: Start difference. First operand 180 states and 229 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:26:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,735 INFO L93 Difference]: Finished difference Result 180 states and 229 transitions. [2025-03-04 10:26:10,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:10,735 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2025-03-04 10:26:10,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,736 INFO L225 Difference]: With dead ends: 180 [2025-03-04 10:26:10,736 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 10:26:10,737 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-04 10:26:10,737 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 16 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 154 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-04 10:26:10,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 154 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:10,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 10:26:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-04 10:26:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 159 states have (on average 1.2641509433962264) internal successors, (201), 159 states have internal predecessors, (201), 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-04 10:26:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 222 transitions. [2025-03-04 10:26:10,748 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 222 transitions. Word has length 67 [2025-03-04 10:26:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,748 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 222 transitions. [2025-03-04 10:26:10,748 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:26:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 222 transitions. [2025-03-04 10:26:10,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 10:26:10,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,749 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:26:10,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:26:10,749 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:10,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1776460717, now seen corresponding path program 1 times [2025-03-04 10:26:10,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963520462] [2025-03-04 10:26:10,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 10:26:10,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 10:26:10,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 10:26:10,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963520462] [2025-03-04 10:26:10,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963520462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:26:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106598119] [2025-03-04 10:26:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:26:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:26:10,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:26:10,912 INFO L87 Difference]: Start difference. First operand 175 states and 222 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:26:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,033 INFO L93 Difference]: Finished difference Result 218 states and 273 transitions. [2025-03-04 10:26:11,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:26:11,033 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 76 [2025-03-04 10:26:11,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,034 INFO L225 Difference]: With dead ends: 218 [2025-03-04 10:26:11,035 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 10:26:11,035 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-04 10:26:11,035 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 24 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:11,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 587 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 10:26:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2025-03-04 10:26:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 170 states have (on average 1.2588235294117647) internal successors, (214), 170 states have internal predecessors, (214), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2025-03-04 10:26:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 239 transitions. [2025-03-04 10:26:11,044 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 239 transitions. Word has length 76 [2025-03-04 10:26:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,044 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 239 transitions. [2025-03-04 10:26:11,044 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:26:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 239 transitions. [2025-03-04 10:26:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 10:26:11,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,045 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:26:11,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:26:11,045 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:11,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2034065837, now seen corresponding path program 1 times [2025-03-04 10:26:11,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:11,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548019013] [2025-03-04 10:26:11,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:11,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:26:11,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:26:11,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 10:26:11,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:11,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548019013] [2025-03-04 10:26:11,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548019013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:11,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:11,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:11,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089751321] [2025-03-04 10:26:11,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:11,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:11,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:11,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:11,109 INFO L87 Difference]: Start difference. First operand 188 states and 239 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:26:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,126 INFO L93 Difference]: Finished difference Result 201 states and 251 transitions. [2025-03-04 10:26:11,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:11,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 77 [2025-03-04 10:26:11,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,127 INFO L225 Difference]: With dead ends: 201 [2025-03-04 10:26:11,127 INFO L226 Difference]: Without dead ends: 188 [2025-03-04 10:26:11,128 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-04 10:26:11,128 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:11,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-04 10:26:11,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2025-03-04 10:26:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 159 states have (on average 1.2578616352201257) internal successors, (200), 159 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-04 10:26:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 221 transitions. [2025-03-04 10:26:11,136 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 221 transitions. Word has length 77 [2025-03-04 10:26:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,136 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 221 transitions. [2025-03-04 10:26:11,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:26:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 221 transitions. [2025-03-04 10:26:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 10:26:11,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,137 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:26:11,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:26:11,137 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:11,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:11,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1926213647, now seen corresponding path program 1 times [2025-03-04 10:26:11,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:11,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751305627] [2025-03-04 10:26:11,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:11,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:26:11,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:26:11,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:26:11,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:11,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751305627] [2025-03-04 10:26:11,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751305627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:11,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677530741] [2025-03-04 10:26:11,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:11,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:11,245 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-04 10:26:11,247 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-04 10:26:11,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:26:11,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:26:11,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:26:11,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:26:11,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:11,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677530741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:11,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:11,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 10 [2025-03-04 10:26:11,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33747785] [2025-03-04 10:26:11,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:11,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:26:11,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:11,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:26:11,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:26:11,363 INFO L87 Difference]: Start difference. First operand 175 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, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:26:11,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,498 INFO L93 Difference]: Finished difference Result 314 states and 390 transitions. [2025-03-04 10:26:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:26:11,498 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, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 77 [2025-03-04 10:26:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,499 INFO L225 Difference]: With dead ends: 314 [2025-03-04 10:26:11,499 INFO L226 Difference]: Without dead ends: 275 [2025-03-04 10:26:11,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 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-04 10:26:11,500 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 93 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:11,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 641 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-04 10:26:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 192. [2025-03-04 10:26:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 174 states have (on average 1.2471264367816093) internal successors, (217), 173 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-04 10:26:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 244 transitions. [2025-03-04 10:26:11,509 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 244 transitions. Word has length 77 [2025-03-04 10:26:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,509 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 244 transitions. [2025-03-04 10:26:11,509 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, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:26:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 244 transitions. [2025-03-04 10:26:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 10:26:11,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,510 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:26:11,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:26:11,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:11,713 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:11,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1003530064, now seen corresponding path program 1 times [2025-03-04 10:26:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989016881] [2025-03-04 10:26:11,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:11,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:26:11,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:26:11,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:26:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:11,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989016881] [2025-03-04 10:26:11,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989016881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:11,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:11,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:26:11,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422610311] [2025-03-04 10:26:11,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:11,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:26:11,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:11,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:26:11,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:26:11,922 INFO L87 Difference]: Start difference. First operand 192 states and 244 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:26:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:12,045 INFO L93 Difference]: Finished difference Result 293 states and 364 transitions. [2025-03-04 10:26:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:26:12,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 77 [2025-03-04 10:26:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:12,046 INFO L225 Difference]: With dead ends: 293 [2025-03-04 10:26:12,046 INFO L226 Difference]: Without dead ends: 254 [2025-03-04 10:26:12,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:26:12,047 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 59 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:12,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 606 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-04 10:26:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 214. [2025-03-04 10:26:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 196 states have (on average 1.2448979591836735) internal successors, (244), 193 states have internal predecessors, (244), 10 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (17), 16 states have call predecessors, (17), 10 states have call successors, (17) [2025-03-04 10:26:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 271 transitions. [2025-03-04 10:26:12,059 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 271 transitions. Word has length 77 [2025-03-04 10:26:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:12,059 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 271 transitions. [2025-03-04 10:26:12,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:26:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 271 transitions. [2025-03-04 10:26:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 10:26:12,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:12,061 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 10:26:12,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:26:12,061 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 10:26:12,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash 762975677, now seen corresponding path program 1 times [2025-03-04 10:26:12,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:12,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338715373] [2025-03-04 10:26:12,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:12,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:12,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 10:26:12,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 10:26:12,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:12,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:26:12,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:12,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338715373] [2025-03-04 10:26:12,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338715373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:12,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:12,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:26:12,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836054255] [2025-03-04 10:26:12,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:12,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:26:12,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:12,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:26:12,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:26:12,313 INFO L87 Difference]: Start difference. First operand 214 states and 271 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:26:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:12,388 INFO L93 Difference]: Finished difference Result 249 states and 313 transitions. [2025-03-04 10:26:12,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:26:12,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 79 [2025-03-04 10:26:12,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:12,389 INFO L225 Difference]: With dead ends: 249 [2025-03-04 10:26:12,389 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:26:12,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:26:12,390 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 68 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:12,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 486 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:26:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:26:12,391 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-04 10:26:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:26:12,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2025-03-04 10:26:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:12,391 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:26:12,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:26:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:26:12,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:26:12,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-03-04 10:26:12,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-04 10:26:12,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-04 10:26:12,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-03-04 10:26:12,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-04 10:26:12,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-04 10:26:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-04 10:26:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-04 10:26:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-04 10:26:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-04 10:26:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-04 10:26:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-04 10:26:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-04 10:26:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-04 10:26:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-04 10:26:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-04 10:26:12,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:26:12,398 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] [2025-03-04 10:26:12,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:26:13,091 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:26:13,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:26:13 BoogieIcfgContainer [2025-03-04 10:26:13,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:26:13,110 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:26:13,110 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:26:13,111 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:26:13,111 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:26:05" (3/4) ... [2025-03-04 10:26:13,113 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:26:13,118 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure base2flt [2025-03-04 10:26:13,119 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:26:13,125 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 10:26:13,125 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 10:26:13,125 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:26:13,126 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:26:13,149 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) [2025-03-04 10:26:13,150 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)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) [2025-03-04 10:26:13,175 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)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) [2025-03-04 10:26:13,175 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) [2025-03-04 10:26:13,207 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:26:13,207 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:26:13,207 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:26:13,209 INFO L158 Benchmark]: Toolchain (without parser) took 8161.89ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 105.9MB in the beginning and 290.5MB in the end (delta: -184.6MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2025-03-04 10:26:13,209 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:26:13,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.47ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 92.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:26:13,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.06ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:26:13,209 INFO L158 Benchmark]: Boogie Preprocessor took 45.91ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:26:13,210 INFO L158 Benchmark]: IcfgBuilder took 448.48ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 60.5MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:26:13,210 INFO L158 Benchmark]: TraceAbstraction took 7333.19ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 60.5MB in the beginning and 295.5MB in the end (delta: -235.0MB). Peak memory consumption was 119.4MB. Max. memory is 16.1GB. [2025-03-04 10:26:13,211 INFO L158 Benchmark]: Witness Printer took 97.02ms. Allocated memory is still 352.3MB. Free memory was 295.5MB in the beginning and 290.5MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:26:13,212 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.47ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 92.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.06ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.91ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 448.48ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 60.5MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7333.19ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 60.5MB in the beginning and 295.5MB in the end (delta: -235.0MB). Peak memory consumption was 119.4MB. Max. memory is 16.1GB. * Witness Printer took 97.02ms. Allocated memory is still 352.3MB. Free memory was 295.5MB in the beginning and 290.5MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: 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, 127 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1248 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1208 mSDsluCounter, 9205 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7086 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2079 IncrementalHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 2119 mSDtfsCounter, 2079 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=21, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 403 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1118 NumberOfCodeBlocks, 1100 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1178 ConstructedInterpolants, 0 QuantifiedInterpolants, 2176 SizeOfPredicates, 4 NumberOfNonLiveVariables, 737 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 30 InterpolantComputations, 20 PerfectInterpolantSequences, 372/405 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: 37]: Location Invariant Derived location invariant: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) - InvariantResult [Line: 57]: Location Invariant Derived location invariant: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:26:13,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE