./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_2.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_2.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 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:26:05,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:26:05,259 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:05,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:26:05,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:26:05,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:26:05,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:26:05,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:26:05,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:26:05,288 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:26:05,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:26:05,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:26:05,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:26:05,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:26:05,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:26:05,290 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:26:05,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:26:05,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:26:05,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:26:05,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:26:05,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:26:05,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:26:05,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:26:05,291 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:26:05,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:26:05,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:26:05,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:26:05,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:26:05,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:26:05,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:26:05,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:26:05,291 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 -> 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff [2025-03-04 10:26:05,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:26:05,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:26:05,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:26:05,561 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:26:05,562 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:26:05,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2025-03-04 10:26:06,782 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b10f4580/7742005f7a6f4802808983e674bd4f66/FLAG31cd27891 [2025-03-04 10:26:07,000 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:26:07,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2025-03-04 10:26:07,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b10f4580/7742005f7a6f4802808983e674bd4f66/FLAG31cd27891 [2025-03-04 10:26:07,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b10f4580/7742005f7a6f4802808983e674bd4f66 [2025-03-04 10:26:07,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:26:07,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:26:07,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:26:07,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:26:07,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:26:07,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:26:07" (1/1) ... [2025-03-04 10:26:07,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33215fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:07, skipping insertion in model container [2025-03-04 10:26:07,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:26:07" (1/1) ... [2025-03-04 10:26:07,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:26:07,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:26:07,240 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:26:07,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:26:07,289 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:26:07,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:07 WrapperNode [2025-03-04 10:26:07,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:26:07,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:26:07,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:26:07,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:26:07,295 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:07" (1/1) ... [2025-03-04 10:26:07,303 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:07" (1/1) ... [2025-03-04 10:26:07,319 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2025-03-04 10:26:07,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:26:07,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:26:07,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:26:07,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:26:07,334 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:07" (1/1) ... [2025-03-04 10:26:07,334 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:07" (1/1) ... [2025-03-04 10:26:07,340 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:07" (1/1) ... [2025-03-04 10:26:07,359 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:07,359 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:07" (1/1) ... [2025-03-04 10:26:07,359 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:07" (1/1) ... [2025-03-04 10:26:07,365 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:07" (1/1) ... [2025-03-04 10:26:07,366 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:07" (1/1) ... [2025-03-04 10:26:07,367 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:07" (1/1) ... [2025-03-04 10:26:07,369 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:07" (1/1) ... [2025-03-04 10:26:07,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:26:07,373 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:26:07,373 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:26:07,373 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:26:07,374 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:07" (1/1) ... [2025-03-04 10:26:07,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:26:07,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:07,401 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:07,403 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:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:26:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:26:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-04 10:26:07,421 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-04 10:26:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:26:07,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:26:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:26:07,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:26:07,480 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:26:07,482 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:26:07,803 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-04 10:26:07,803 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:26:07,830 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:26:07,831 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:26:07,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:26:07 BoogieIcfgContainer [2025-03-04 10:26:07,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:26:07,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:26:07,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:26:07,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:26:07,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:26:07" (1/3) ... [2025-03-04 10:26:07,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a67a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:26:07, skipping insertion in model container [2025-03-04 10:26:07,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:07" (2/3) ... [2025-03-04 10:26:07,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a67a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:26:07, skipping insertion in model container [2025-03-04 10:26:07,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:26:07" (3/3) ... [2025-03-04 10:26:07,841 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2025-03-04 10:26:07,852 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:26:07,854 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_2.c.cil.c that has 3 procedures, 123 locations, 1 initial locations, 2 loop locations, and 24 error locations. [2025-03-04 10:26:07,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:26:07,910 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;@7326ec6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:26:07,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-04 10:26:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 91 states have (on average 1.6263736263736264) internal successors, (148), 116 states have internal predecessors, (148), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:26:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:26:07,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:07,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:07,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:07,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:07,927 INFO L85 PathProgramCache]: Analyzing trace with hash 950840293, now seen corresponding path program 1 times [2025-03-04 10:26:07,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:07,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376176992] [2025-03-04 10:26:07,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:07,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:07,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:26:08,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:26:08,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,119 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:08,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:08,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376176992] [2025-03-04 10:26:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376176992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:08,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:08,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207028858] [2025-03-04 10:26:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:08,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:08,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:08,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:08,144 INFO L87 Difference]: Start difference. First operand has 123 states, 91 states have (on average 1.6263736263736264) internal successors, (148), 116 states have internal predecessors, (148), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 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:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:08,295 INFO L93 Difference]: Finished difference Result 297 states and 403 transitions. [2025-03-04 10:26:08,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:08,298 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:08,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:08,307 INFO L225 Difference]: With dead ends: 297 [2025-03-04 10:26:08,307 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 10:26:08,311 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:08,314 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 90 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:08,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 376 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 10:26:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2025-03-04 10:26:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.495798319327731) internal successors, (178), 138 states have internal predecessors, (178), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 186 transitions. [2025-03-04 10:26:08,358 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 186 transitions. Word has length 9 [2025-03-04 10:26:08,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:08,359 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 186 transitions. [2025-03-04 10:26:08,359 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:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 186 transitions. [2025-03-04 10:26:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:26:08,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:08,360 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:08,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:26:08,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:08,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1506931202, now seen corresponding path program 1 times [2025-03-04 10:26:08,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:08,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280731280] [2025-03-04 10:26:08,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:08,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:26:08,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:26:08,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,398 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:08,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:08,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280731280] [2025-03-04 10:26:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280731280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:08,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:08,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:26:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058152354] [2025-03-04 10:26:08,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:08,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:08,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:08,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:08,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:08,400 INFO L87 Difference]: Start difference. First operand 145 states and 186 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:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:08,444 INFO L93 Difference]: Finished difference Result 145 states and 186 transitions. [2025-03-04 10:26:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:08,444 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:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:08,447 INFO L225 Difference]: With dead ends: 145 [2025-03-04 10:26:08,447 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 10:26:08,447 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:08,448 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:08,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 195 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 10:26:08,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-04 10:26:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 137 states have internal predecessors, (176), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 184 transitions. [2025-03-04 10:26:08,465 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 184 transitions. Word has length 14 [2025-03-04 10:26:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:08,465 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 184 transitions. [2025-03-04 10:26:08,466 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:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 184 transitions. [2025-03-04 10:26:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:26:08,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:08,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:08,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:26:08,468 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:08,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1506917297, now seen corresponding path program 1 times [2025-03-04 10:26:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:08,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325250973] [2025-03-04 10:26:08,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:08,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:08,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:26:08,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:26:08,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,529 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:08,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:08,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325250973] [2025-03-04 10:26:08,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325250973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:08,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:08,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:08,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900913076] [2025-03-04 10:26:08,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:08,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:08,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:08,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:08,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:08,531 INFO L87 Difference]: Start difference. First operand 144 states and 184 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:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:08,595 INFO L93 Difference]: Finished difference Result 299 states and 389 transitions. [2025-03-04 10:26:08,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:08,595 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:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:08,597 INFO L225 Difference]: With dead ends: 299 [2025-03-04 10:26:08,597 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 10:26:08,598 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:08,598 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:08,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 204 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 10:26:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2025-03-04 10:26:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.4634146341463414) internal successors, (180), 141 states have internal predecessors, (180), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 188 transitions. [2025-03-04 10:26:08,634 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 188 transitions. Word has length 14 [2025-03-04 10:26:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:08,634 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 188 transitions. [2025-03-04 10:26:08,635 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:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2025-03-04 10:26:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:26:08,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:08,635 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:08,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:26:08,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:08,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash 529772992, now seen corresponding path program 1 times [2025-03-04 10:26:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:08,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813073872] [2025-03-04 10:26:08,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:08,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:26:08,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:26:08,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,744 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:08,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:08,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813073872] [2025-03-04 10:26:08,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813073872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:08,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712347015] [2025-03-04 10:26:08,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:08,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:08,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:08,748 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:08,761 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:08,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:26:08,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:26:08,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:26:08,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:08,865 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:08,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:08,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712347015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:08,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:08,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 10:26:08,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231407349] [2025-03-04 10:26:08,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:08,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:08,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:08,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:08,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:26:08,871 INFO L87 Difference]: Start difference. First operand 148 states and 188 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:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:08,933 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2025-03-04 10:26:08,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:08,935 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:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:08,936 INFO L225 Difference]: With dead ends: 160 [2025-03-04 10:26:08,936 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 10:26:08,936 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:08,937 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 17 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:08,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 185 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 10:26:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2025-03-04 10:26:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.456) internal successors, (182), 143 states have internal predecessors, (182), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 190 transitions. [2025-03-04 10:26:08,951 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 190 transitions. Word has length 15 [2025-03-04 10:26:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:08,951 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 190 transitions. [2025-03-04 10:26:08,951 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:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2025-03-04 10:26:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:26:08,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:08,952 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:08,960 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:09,152 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:09,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:09,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash 530354974, now seen corresponding path program 1 times [2025-03-04 10:26:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:09,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570658594] [2025-03-04 10:26:09,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:09,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:09,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:26:09,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:26:09,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:09,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:09,229 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:09,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:09,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570658594] [2025-03-04 10:26:09,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570658594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:09,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:09,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:09,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645499855] [2025-03-04 10:26:09,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:09,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:09,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:09,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:09,230 INFO L87 Difference]: Start difference. First operand 150 states and 190 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:09,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:09,342 INFO L93 Difference]: Finished difference Result 325 states and 411 transitions. [2025-03-04 10:26:09,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:26:09,343 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:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:09,344 INFO L225 Difference]: With dead ends: 325 [2025-03-04 10:26:09,344 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 10:26:09,344 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:09,348 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 126 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:09,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 363 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 10:26:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 163. [2025-03-04 10:26:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.4275362318840579) internal successors, (197), 156 states have internal predecessors, (197), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 205 transitions. [2025-03-04 10:26:09,356 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 205 transitions. Word has length 15 [2025-03-04 10:26:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:09,357 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 205 transitions. [2025-03-04 10:26:09,357 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:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2025-03-04 10:26:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:26:09,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:09,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:09,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:26:09,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:09,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:09,358 INFO L85 PathProgramCache]: Analyzing trace with hash -738865006, now seen corresponding path program 1 times [2025-03-04 10:26:09,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:09,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725205709] [2025-03-04 10:26:09,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:09,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:09,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:26:09,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:26:09,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:09,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:09,402 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:09,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:09,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725205709] [2025-03-04 10:26:09,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725205709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:09,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:09,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:09,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064857074] [2025-03-04 10:26:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:09,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:09,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:09,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:09,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:09,403 INFO L87 Difference]: Start difference. First operand 163 states and 205 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, (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:09,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:09,511 INFO L93 Difference]: Finished difference Result 182 states and 220 transitions. [2025-03-04 10:26:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:09,512 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, (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 16 [2025-03-04 10:26:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:09,513 INFO L225 Difference]: With dead ends: 182 [2025-03-04 10:26:09,513 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 10:26:09,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:26:09,513 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:09,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 363 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 10:26:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2025-03-04 10:26:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 146 states have (on average 1.404109589041096) internal successors, (205), 164 states have internal predecessors, (205), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 213 transitions. [2025-03-04 10:26:09,520 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 213 transitions. Word has length 16 [2025-03-04 10:26:09,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:09,520 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 213 transitions. [2025-03-04 10:26:09,520 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, (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:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 213 transitions. [2025-03-04 10:26:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:26:09,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:09,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:09,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:26:09,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:09,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:09,522 INFO L85 PathProgramCache]: Analyzing trace with hash -638535235, now seen corresponding path program 1 times [2025-03-04 10:26:09,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:09,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031604114] [2025-03-04 10:26:09,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:09,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:09,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:26:09,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:26:09,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:09,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:26:09,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:09,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031604114] [2025-03-04 10:26:09,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031604114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:09,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:09,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:26:09,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279698053] [2025-03-04 10:26:09,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:09,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:09,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:09,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:09,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:09,539 INFO L87 Difference]: Start difference. First operand 171 states and 213 transitions. Second operand has 3 states, 2 states have (on average 6.5) 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:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:09,574 INFO L93 Difference]: Finished difference Result 171 states and 213 transitions. [2025-03-04 10:26:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:09,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) 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 16 [2025-03-04 10:26:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:09,575 INFO L225 Difference]: With dead ends: 171 [2025-03-04 10:26:09,575 INFO L226 Difference]: Without dead ends: 170 [2025-03-04 10:26:09,575 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:09,576 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:09,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 190 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-04 10:26:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2025-03-04 10:26:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 144 states have (on average 1.3958333333333333) internal successors, (201), 161 states have internal predecessors, (201), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 209 transitions. [2025-03-04 10:26:09,581 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 209 transitions. Word has length 16 [2025-03-04 10:26:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:09,581 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 209 transitions. [2025-03-04 10:26:09,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) 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:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 209 transitions. [2025-03-04 10:26:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:26:09,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:09,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:09,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:26:09,582 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:09,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:09,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1455885710, now seen corresponding path program 1 times [2025-03-04 10:26:09,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:09,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413526862] [2025-03-04 10:26:09,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:09,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:26:09,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:26:09,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:09,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:09,608 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:09,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:09,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413526862] [2025-03-04 10:26:09,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413526862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:09,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:09,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:09,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948724954] [2025-03-04 10:26:09,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:09,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:09,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:09,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:09,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:09,610 INFO L87 Difference]: Start difference. First operand 168 states and 209 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:09,643 INFO L93 Difference]: Finished difference Result 342 states and 430 transitions. [2025-03-04 10:26:09,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:09,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 16 [2025-03-04 10:26:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:09,645 INFO L225 Difference]: With dead ends: 342 [2025-03-04 10:26:09,645 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 10:26:09,645 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:09,646 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 8 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:09,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 204 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 10:26:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2025-03-04 10:26:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 146 states have (on average 1.3767123287671232) internal successors, (201), 163 states have internal predecessors, (201), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2025-03-04 10:26:09,654 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 16 [2025-03-04 10:26:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:09,654 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2025-03-04 10:26:09,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2025-03-04 10:26:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:26:09,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:09,659 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:09,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:26:09,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:09,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:09,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1680431884, now seen corresponding path program 1 times [2025-03-04 10:26:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:09,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453798736] [2025-03-04 10:26:09,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:09,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:09,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:26:09,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:26:09,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:09,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:09,701 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:09,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453798736] [2025-03-04 10:26:09,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453798736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:09,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108580226] [2025-03-04 10:26:09,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:09,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:09,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:09,703 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:09,705 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:09,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:26:09,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:26:09,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:09,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:09,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:26:09,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:09,767 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:09,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:09,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108580226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:09,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:09,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 10:26:09,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208224885] [2025-03-04 10:26:09,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:09,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:09,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:09,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:09,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:26:09,768 INFO L87 Difference]: Start difference. First operand 170 states and 209 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:09,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:09,821 INFO L93 Difference]: Finished difference Result 180 states and 224 transitions. [2025-03-04 10:26:09,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:09,822 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:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:09,823 INFO L225 Difference]: With dead ends: 180 [2025-03-04 10:26:09,823 INFO L226 Difference]: Without dead ends: 179 [2025-03-04 10:26:09,823 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:09,824 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 9 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:09,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 286 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-04 10:26:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2025-03-04 10:26:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 168 states have internal predecessors, (206), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:09,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 214 transitions. [2025-03-04 10:26:09,831 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 214 transitions. Word has length 17 [2025-03-04 10:26:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:09,831 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 214 transitions. [2025-03-04 10:26:09,831 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:09,831 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 214 transitions. [2025-03-04 10:26:09,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:26:09,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:09,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:09,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:26:10,036 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,SelfDestructingSolverStorable8 [2025-03-04 10:26:10,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:10,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1881576891, now seen corresponding path program 1 times [2025-03-04 10:26:10,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098657513] [2025-03-04 10:26:10,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:26:10,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:26:10,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,082 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:10,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098657513] [2025-03-04 10:26:10,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098657513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:10,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510689358] [2025-03-04 10:26:10,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:10,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:10,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:10,083 INFO L87 Difference]: Start difference. First operand 175 states and 214 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:10,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,128 INFO L93 Difference]: Finished difference Result 352 states and 430 transitions. [2025-03-04 10:26:10,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:10,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:10,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,130 INFO L225 Difference]: With dead ends: 352 [2025-03-04 10:26:10,130 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 10:26:10,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:10,131 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 4 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:10,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 304 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 10:26:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-04 10:26:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 155 states have (on average 1.3548387096774193) internal successors, (210), 172 states have internal predecessors, (210), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 218 transitions. [2025-03-04 10:26:10,138 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 218 transitions. Word has length 17 [2025-03-04 10:26:10,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,138 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 218 transitions. [2025-03-04 10:26:10,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 218 transitions. [2025-03-04 10:26:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:26:10,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,139 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:10,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:26:10,139 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash -547318405, now seen corresponding path program 1 times [2025-03-04 10:26:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763781985] [2025-03-04 10:26:10,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:26:10,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:26:10,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,181 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:10,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763781985] [2025-03-04 10:26:10,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763781985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071635116] [2025-03-04 10:26:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:10,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:10,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:10,183 INFO L87 Difference]: Start difference. First operand 180 states and 218 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:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,271 INFO L93 Difference]: Finished difference Result 240 states and 294 transitions. [2025-03-04 10:26:10,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:10,272 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:10,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,273 INFO L225 Difference]: With dead ends: 240 [2025-03-04 10:26:10,273 INFO L226 Difference]: Without dead ends: 238 [2025-03-04 10:26:10,273 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:10,273 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 147 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:10,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 291 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-04 10:26:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 214. [2025-03-04 10:26:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 188 states have (on average 1.377659574468085) internal successors, (259), 205 states have internal predecessors, (259), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 267 transitions. [2025-03-04 10:26:10,284 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 267 transitions. Word has length 24 [2025-03-04 10:26:10,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,284 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 267 transitions. [2025-03-04 10:26:10,284 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:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 267 transitions. [2025-03-04 10:26:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:26:10,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,285 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:10,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:26:10,285 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:10,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,286 INFO L85 PathProgramCache]: Analyzing trace with hash -546026407, now seen corresponding path program 1 times [2025-03-04 10:26:10,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202553618] [2025-03-04 10:26:10,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:26:10,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:26:10,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,328 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:10,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202553618] [2025-03-04 10:26:10,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202553618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:10,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767898200] [2025-03-04 10:26:10,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:10,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:10,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:10,330 INFO L87 Difference]: Start difference. First operand 214 states and 267 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:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,416 INFO L93 Difference]: Finished difference Result 233 states and 283 transitions. [2025-03-04 10:26:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:10,417 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:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,418 INFO L225 Difference]: With dead ends: 233 [2025-03-04 10:26:10,418 INFO L226 Difference]: Without dead ends: 229 [2025-03-04 10:26:10,419 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:10,419 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 138 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:10,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 289 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-04 10:26:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 217. [2025-03-04 10:26:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 192 states have (on average 1.3489583333333333) internal successors, (259), 208 states have internal predecessors, (259), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 267 transitions. [2025-03-04 10:26:10,433 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 267 transitions. Word has length 24 [2025-03-04 10:26:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,433 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 267 transitions. [2025-03-04 10:26:10,433 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:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 267 transitions. [2025-03-04 10:26:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:26:10,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,434 INFO L218 NwaCegarLoop]: trace histogram [2, 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,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:26:10,434 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:10,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1351413023, now seen corresponding path program 1 times [2025-03-04 10:26:10,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583297166] [2025-03-04 10:26:10,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:26:10,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:26:10,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,474 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:10,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583297166] [2025-03-04 10:26:10,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583297166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:10,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790686780] [2025-03-04 10:26:10,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:10,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:10,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:10,475 INFO L87 Difference]: Start difference. First operand 217 states and 267 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,519 INFO L93 Difference]: Finished difference Result 369 states and 453 transitions. [2025-03-04 10:26:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:10,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2025-03-04 10:26:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,520 INFO L225 Difference]: With dead ends: 369 [2025-03-04 10:26:10,520 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 10:26:10,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:10,521 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 38 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:10,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 304 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 10:26:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-03-04 10:26:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 166 states have (on average 1.3614457831325302) internal successors, (226), 182 states have internal predecessors, (226), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 234 transitions. [2025-03-04 10:26:10,527 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 234 transitions. Word has length 24 [2025-03-04 10:26:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,528 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 234 transitions. [2025-03-04 10:26:10,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:10,528 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 234 transitions. [2025-03-04 10:26:10,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 10:26:10,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,528 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:10,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:26:10,528 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:10,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash 463464337, now seen corresponding path program 1 times [2025-03-04 10:26:10,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123015701] [2025-03-04 10:26:10,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:26:10,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:26:10,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:26:10,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123015701] [2025-03-04 10:26:10,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123015701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305605358] [2025-03-04 10:26:10,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:10,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:10,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:10,561 INFO L87 Difference]: Start difference. First operand 191 states and 234 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 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:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,609 INFO L93 Difference]: Finished difference Result 200 states and 245 transitions. [2025-03-04 10:26:10,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:10,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 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 27 [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: 200 [2025-03-04 10:26:10,611 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 10:26:10,611 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:10,612 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 10 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:10,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 267 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 10:26:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 184. [2025-03-04 10:26:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 159 states have (on average 1.3522012578616351) internal successors, (215), 175 states have internal predecessors, (215), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 223 transitions. [2025-03-04 10:26:10,642 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 223 transitions. Word has length 27 [2025-03-04 10:26:10,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,642 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 223 transitions. [2025-03-04 10:26:10,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 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:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 223 transitions. [2025-03-04 10:26:10,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 10:26:10,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,643 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:10,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:26:10,643 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:10,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash -171937763, now seen corresponding path program 1 times [2025-03-04 10:26:10,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494209323] [2025-03-04 10:26:10,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:26:10,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:26:10,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:26:10,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494209323] [2025-03-04 10:26:10,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494209323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:10,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135461295] [2025-03-04 10:26:10,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:10,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:10,718 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:10,720 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:10,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:26:10,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:26:10,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:26:10,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:26:10,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:26:10,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135461295] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:10,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:10,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 10:26:10,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6733399] [2025-03-04 10:26:10,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:26:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:26:10,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:26:10,916 INFO L87 Difference]: Start difference. First operand 184 states and 223 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:26:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,168 INFO L93 Difference]: Finished difference Result 650 states and 826 transitions. [2025-03-04 10:26:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:26:11,168 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2025-03-04 10:26:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,170 INFO L225 Difference]: With dead ends: 650 [2025-03-04 10:26:11,170 INFO L226 Difference]: Without dead ends: 501 [2025-03-04 10:26:11,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:26:11,171 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 276 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:11,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 416 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:26:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-04 10:26:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 204. [2025-03-04 10:26:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 179 states have (on average 1.335195530726257) internal successors, (239), 195 states have internal predecessors, (239), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 247 transitions. [2025-03-04 10:26:11,183 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 247 transitions. Word has length 44 [2025-03-04 10:26:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,184 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 247 transitions. [2025-03-04 10:26:11,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:26:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 247 transitions. [2025-03-04 10:26:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 10:26:11,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,185 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:11,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:11,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:11,386 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:11,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:11,386 INFO L85 PathProgramCache]: Analyzing trace with hash 106061170, now seen corresponding path program 1 times [2025-03-04 10:26:11,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:11,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476704776] [2025-03-04 10:26:11,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:11,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:26:11,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:26:11,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:26:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:11,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476704776] [2025-03-04 10:26:11,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476704776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:11,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:11,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:11,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028137475] [2025-03-04 10:26:11,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:11,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:11,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:11,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:11,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:11,452 INFO L87 Difference]: Start difference. First operand 204 states and 247 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:26:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,534 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2025-03-04 10:26:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:11,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-04 10:26:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,535 INFO L225 Difference]: With dead ends: 212 [2025-03-04 10:26:11,536 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 10:26:11,536 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:11,536 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 143 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:11,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 305 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 10:26:11,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 193. [2025-03-04 10:26:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 170 states have (on average 1.3235294117647058) internal successors, (225), 184 states have internal predecessors, (225), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 233 transitions. [2025-03-04 10:26:11,555 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 233 transitions. Word has length 47 [2025-03-04 10:26:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,555 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 233 transitions. [2025-03-04 10:26:11,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:26:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 233 transitions. [2025-03-04 10:26:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 10:26:11,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,556 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2025-03-04 10:26:11,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:26:11,556 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:11,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:11,556 INFO L85 PathProgramCache]: Analyzing trace with hash 107353168, now seen corresponding path program 1 times [2025-03-04 10:26:11,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:11,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528791674] [2025-03-04 10:26:11,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:11,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:26:11,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:26:11,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:26:11,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:11,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528791674] [2025-03-04 10:26:11,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528791674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:11,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:11,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:11,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813018331] [2025-03-04 10:26:11,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:11,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:11,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:11,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:11,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:11,606 INFO L87 Difference]: Start difference. First operand 193 states and 233 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:26:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,690 INFO L93 Difference]: Finished difference Result 199 states and 239 transitions. [2025-03-04 10:26:11,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:11,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-04 10:26:11,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,691 INFO L225 Difference]: With dead ends: 199 [2025-03-04 10:26:11,691 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 10:26:11,692 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:11,692 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 126 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:11,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 311 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 10:26:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2025-03-04 10:26:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 165 states have (on average 1.3151515151515152) internal successors, (217), 176 states have internal predecessors, (217), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 225 transitions. [2025-03-04 10:26:11,700 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 225 transitions. Word has length 47 [2025-03-04 10:26:11,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,700 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 225 transitions. [2025-03-04 10:26:11,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:26:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 225 transitions. [2025-03-04 10:26:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 10:26:11,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,701 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:11,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:26:11,701 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:11,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:11,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1220348714, now seen corresponding path program 1 times [2025-03-04 10:26:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:11,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066655629] [2025-03-04 10:26:11,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:11,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:26:11,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:26:11,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:26:11,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:11,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066655629] [2025-03-04 10:26:11,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066655629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:11,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:11,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:11,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093982198] [2025-03-04 10:26:11,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:11,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:11,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:11,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:11,765 INFO L87 Difference]: Start difference. First operand 185 states and 225 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:26:11,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,824 INFO L93 Difference]: Finished difference Result 347 states and 423 transitions. [2025-03-04 10:26:11,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:26:11,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2025-03-04 10:26:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,826 INFO L225 Difference]: With dead ends: 347 [2025-03-04 10:26:11,826 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 10:26:11,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:11,826 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 11 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:11,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 10:26:11,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 181. [2025-03-04 10:26:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.3043478260869565) internal successors, (210), 172 states have internal predecessors, (210), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 218 transitions. [2025-03-04 10:26:11,835 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 218 transitions. Word has length 47 [2025-03-04 10:26:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,836 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 218 transitions. [2025-03-04 10:26:11,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:26:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 218 transitions. [2025-03-04 10:26:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:26:11,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,836 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:11,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:26:11,837 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:11,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:11,837 INFO L85 PathProgramCache]: Analyzing trace with hash -576577399, now seen corresponding path program 1 times [2025-03-04 10:26:11,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:11,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367514362] [2025-03-04 10:26:11,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:11,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:26:11,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:26:11,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:11,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:11,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367514362] [2025-03-04 10:26:11,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367514362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:11,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:11,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:26:11,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530906750] [2025-03-04 10:26:11,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:11,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:11,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:11,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:11,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:11,909 INFO L87 Difference]: Start difference. First operand 181 states and 218 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:26:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:12,006 INFO L93 Difference]: Finished difference Result 398 states and 478 transitions. [2025-03-04 10:26:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:12,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2025-03-04 10:26:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:12,008 INFO L225 Difference]: With dead ends: 398 [2025-03-04 10:26:12,008 INFO L226 Difference]: Without dead ends: 262 [2025-03-04 10:26:12,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:26:12,009 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 64 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:12,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 193 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:12,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-04 10:26:12,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 181. [2025-03-04 10:26:12,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 172 states have internal predecessors, (209), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2025-03-04 10:26:12,020 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 48 [2025-03-04 10:26:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:12,020 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2025-03-04 10:26:12,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:26:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2025-03-04 10:26:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 10:26:12,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:12,021 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:12,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:26:12,021 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:12,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:12,022 INFO L85 PathProgramCache]: Analyzing trace with hash 348000278, now seen corresponding path program 1 times [2025-03-04 10:26:12,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:12,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329351162] [2025-03-04 10:26:12,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:12,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:12,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:26:12,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 10:26:12,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:12,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329351162] [2025-03-04 10:26:12,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329351162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526972715] [2025-03-04 10:26:12,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:12,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:12,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:12,162 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:12,164 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:12,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:26:12,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 10:26:12,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:12,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:26:12,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:12,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:12,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526972715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:12,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:12,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 19 [2025-03-04 10:26:12,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513148891] [2025-03-04 10:26:12,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:12,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:26:12,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:12,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:26:12,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:26:12,626 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:26:13,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:13,131 INFO L93 Difference]: Finished difference Result 522 states and 622 transitions. [2025-03-04 10:26:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:26:13,132 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2025-03-04 10:26:13,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:13,134 INFO L225 Difference]: With dead ends: 522 [2025-03-04 10:26:13,134 INFO L226 Difference]: Without dead ends: 370 [2025-03-04 10:26:13,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=416, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:26:13,135 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 231 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:13,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 576 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:26:13,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-04 10:26:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 181. [2025-03-04 10:26:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.2732919254658386) internal successors, (205), 172 states have internal predecessors, (205), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2025-03-04 10:26:13,150 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 53 [2025-03-04 10:26:13,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:13,150 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2025-03-04 10:26:13,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:26:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2025-03-04 10:26:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 10:26:13,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:13,151 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:13,157 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:13,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:13,352 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:13,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1060970559, now seen corresponding path program 1 times [2025-03-04 10:26:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:13,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284244307] [2025-03-04 10:26:13,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:13,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 10:26:13,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 10:26:13,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:13,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:13,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:13,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284244307] [2025-03-04 10:26:13,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284244307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:13,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812139268] [2025-03-04 10:26:13,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:13,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:13,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:13,508 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:13,510 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:13,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 10:26:13,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 10:26:13,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:13,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:13,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:26:13,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:13,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:13,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812139268] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:13,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:13,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-03-04 10:26:13,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438178505] [2025-03-04 10:26:13,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:13,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:26:13,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:13,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:26:13,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:26:13,932 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:14,348 INFO L93 Difference]: Finished difference Result 969 states and 1207 transitions. [2025-03-04 10:26:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:26:14,348 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2025-03-04 10:26:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:14,351 INFO L225 Difference]: With dead ends: 969 [2025-03-04 10:26:14,351 INFO L226 Difference]: Without dead ends: 843 [2025-03-04 10:26:14,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=304, Invalid=508, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:26:14,352 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 550 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:14,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 729 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:26:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-03-04 10:26:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 221. [2025-03-04 10:26:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 201 states have (on average 1.2587064676616915) internal successors, (253), 212 states have internal predecessors, (253), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2025-03-04 10:26:14,364 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 64 [2025-03-04 10:26:14,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:14,364 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2025-03-04 10:26:14,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2025-03-04 10:26:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 10:26:14,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:14,365 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:14,371 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:14,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:14,566 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:14,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:14,566 INFO L85 PathProgramCache]: Analyzing trace with hash -946110506, now seen corresponding path program 2 times [2025-03-04 10:26:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:14,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350295915] [2025-03-04 10:26:14,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:26:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:14,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 10:26:14,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 10:26:14,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:26:14,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:14,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:14,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350295915] [2025-03-04 10:26:14,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350295915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:14,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795762307] [2025-03-04 10:26:14,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:26:14,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:14,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:14,797 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:14,799 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:14,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 10:26:14,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 10:26:14,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:26:14,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:14,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:26:14,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:15,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:17,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795762307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:17,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:17,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 17] total 40 [2025-03-04 10:26:17,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561956910] [2025-03-04 10:26:17,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:17,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 10:26:17,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:17,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 10:26:17,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=1087, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:26:17,465 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand has 40 states, 40 states have (on average 3.725) internal successors, (149), 40 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:26:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:22,458 INFO L93 Difference]: Finished difference Result 710 states and 846 transitions. [2025-03-04 10:26:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 10:26:22,459 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.725) internal successors, (149), 40 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 73 [2025-03-04 10:26:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:22,461 INFO L225 Difference]: With dead ends: 710 [2025-03-04 10:26:22,461 INFO L226 Difference]: Without dead ends: 556 [2025-03-04 10:26:22,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=923, Invalid=1939, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 10:26:22,462 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 346 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:22,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1647 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-04 10:26:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-04 10:26:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 221. [2025-03-04 10:26:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 201 states have (on average 1.2189054726368158) internal successors, (245), 212 states have internal predecessors, (245), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 253 transitions. [2025-03-04 10:26:22,481 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 253 transitions. Word has length 73 [2025-03-04 10:26:22,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:22,481 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 253 transitions. [2025-03-04 10:26:22,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.725) internal successors, (149), 40 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:26:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 253 transitions. [2025-03-04 10:26:22,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 10:26:22,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:22,484 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:22,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:22,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:22,685 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:22,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1625640895, now seen corresponding path program 2 times [2025-03-04 10:26:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:22,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328766145] [2025-03-04 10:26:22,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:26:22,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:22,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-04 10:26:22,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 10:26:22,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:26:22,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:22,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:22,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328766145] [2025-03-04 10:26:22,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328766145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:22,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460022650] [2025-03-04 10:26:22,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:26:22,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:22,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:22,991 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:26:22,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:26:23,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-04 10:26:23,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 10:26:23,037 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:26:23,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:23,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:26:23,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:23,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460022650] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:23,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:23,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2025-03-04 10:26:23,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731531970] [2025-03-04 10:26:23,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:23,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-04 10:26:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:23,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-04 10:26:23,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 10:26:23,806 INFO L87 Difference]: Start difference. First operand 221 states and 253 transitions. Second operand has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:24,460 INFO L93 Difference]: Finished difference Result 1689 states and 2119 transitions. [2025-03-04 10:26:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 10:26:24,461 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2025-03-04 10:26:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:24,465 INFO L225 Difference]: With dead ends: 1689 [2025-03-04 10:26:24,465 INFO L226 Difference]: Without dead ends: 1563 [2025-03-04 10:26:24,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=992, Invalid=1764, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 10:26:24,466 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1242 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:24,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 821 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:26:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2025-03-04 10:26:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 301. [2025-03-04 10:26:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 281 states have (on average 1.2135231316725978) internal successors, (341), 292 states have internal predecessors, (341), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 349 transitions. [2025-03-04 10:26:24,487 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 349 transitions. Word has length 104 [2025-03-04 10:26:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:24,487 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 349 transitions. [2025-03-04 10:26:24,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 349 transitions. [2025-03-04 10:26:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 10:26:24,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:24,488 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:24,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:26:24,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:24,690 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 10:26:24,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash -339329194, now seen corresponding path program 3 times [2025-03-04 10:26:24,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:24,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875809736] [2025-03-04 10:26:24,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:26:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:24,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 113 statements into 15 equivalence classes. [2025-03-04 10:26:24,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 10:26:24,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-04 10:26:24,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:25,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:25,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875809736] [2025-03-04 10:26:25,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875809736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:25,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518584398] [2025-03-04 10:26:25,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:26:25,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:25,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:25,332 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:26:25,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:26:25,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 113 statements into 15 equivalence classes. [2025-03-04 10:26:25,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 10:26:25,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-04 10:26:25,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:25,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 10:26:25,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:28,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:26:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518584398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:36,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34, 33] total 80 [2025-03-04 10:26:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793120506] [2025-03-04 10:26:36,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:36,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2025-03-04 10:26:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:36,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2025-03-04 10:26:36,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1908, Invalid=4412, Unknown=0, NotChecked=0, Total=6320 [2025-03-04 10:26:36,570 INFO L87 Difference]: Start difference. First operand 301 states and 349 transitions. Second operand has 80 states, 80 states have (on average 3.3625) internal successors, (269), 80 states have internal predecessors, (269), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)