./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_2a.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_2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:26:05,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:26:05,632 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,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:26:05,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:26:05,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:26:05,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:26:05,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:26:05,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:26:05,660 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:26:05,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:26:05,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:26:05,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:26:05,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:26:05,660 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:26:05,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:26:05,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:26:05,660 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:26:05,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:26:05,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:26:05,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:26:05,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:26:05,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:26:05,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:26:05,661 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:26:05,661 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:26:05,661 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:26:05,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:26:05,661 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:26:05,661 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:26:05,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:26:05,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:26:05,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:26:05,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:26:05,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:26:05,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:26:05,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:26:05,663 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:26:05,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:26:05,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:26:05,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:26:05,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:26:05,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:26:05,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:26:05,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:26:05,664 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 -> f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c [2025-03-04 10:26:05,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:26:05,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:26:05,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:26:05,898 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:26:05,899 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:26:05,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2025-03-04 10:26:07,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/347f23145/b9799ffa5e1c4d8dbd808d2a00cc8238/FLAGc6af3b60a [2025-03-04 10:26:07,337 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:26:07,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2025-03-04 10:26:07,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/347f23145/b9799ffa5e1c4d8dbd808d2a00cc8238/FLAGc6af3b60a [2025-03-04 10:26:07,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/347f23145/b9799ffa5e1c4d8dbd808d2a00cc8238 [2025-03-04 10:26:07,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:26:07,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:26:07,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:26:07,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:26:07,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:26:07,378 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,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1c6a0 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,379 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,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:26:07,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:26:07,572 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:26:07,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:26:07,626 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:26:07,627 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,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:26:07,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:26:07,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:26:07,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:26:07,632 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,641 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,665 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 166 [2025-03-04 10:26:07,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:26:07,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:26:07,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:26:07,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:26:07,672 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,672 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,673 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,681 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,685 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,686 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,689 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,689 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,690 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,695 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,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:26:07,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:26:07,697 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:26:07,697 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:26:07,698 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,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:26:07,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:07,725 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,726 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,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:26:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:26:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-04 10:26:07,744 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-04 10:26:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:26:07,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:26:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:26:07,745 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:26:07,793 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:26:07,795 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:26:08,091 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2025-03-04 10:26:08,091 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:26:08,115 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:26:08,115 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:26:08,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:26:08 BoogieIcfgContainer [2025-03-04 10:26:08,118 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:26:08,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:26:08,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:26:08,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:26:08,124 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:08,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a3dee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:26:08, skipping insertion in model container [2025-03-04 10:26:08,125 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:08,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a3dee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:26:08, skipping insertion in model container [2025-03-04 10:26:08,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:26:08" (3/3) ... [2025-03-04 10:26:08,127 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2025-03-04 10:26:08,139 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:26:08,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_2a.c.cil.c that has 3 procedures, 111 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-04 10:26:08,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:26:08,199 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;@6db88545, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:26:08,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 10:26:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 85 states have (on average 1.6) internal successors, (136), 104 states have internal predecessors, (136), 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:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:26:08,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:08,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:08,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:08,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:08,215 INFO L85 PathProgramCache]: Analyzing trace with hash -511040487, now seen corresponding path program 1 times [2025-03-04 10:26:08,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:08,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114033973] [2025-03-04 10:26:08,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:08,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:08,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:26:08,291 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,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,407 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,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:08,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114033973] [2025-03-04 10:26:08,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114033973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:08,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:08,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:08,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635379432] [2025-03-04 10:26:08,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:08,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:08,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:08,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:08,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:08,431 INFO L87 Difference]: Start difference. First operand has 111 states, 85 states have (on average 1.6) internal successors, (136), 104 states have internal predecessors, (136), 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,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:08,574 INFO L93 Difference]: Finished difference Result 267 states and 372 transitions. [2025-03-04 10:26:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:08,577 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,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:08,583 INFO L225 Difference]: With dead ends: 267 [2025-03-04 10:26:08,583 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 10:26:08,588 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,589 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 85 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:08,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 346 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 10:26:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2025-03-04 10:26:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 109 states have (on average 1.4678899082568808) internal successors, (160), 122 states have internal predecessors, (160), 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,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 168 transitions. [2025-03-04 10:26:08,627 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 168 transitions. Word has length 9 [2025-03-04 10:26:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:08,627 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 168 transitions. [2025-03-04 10:26:08,627 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,627 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 168 transitions. [2025-03-04 10:26:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:26:08,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:08,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:08,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:26:08,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:08,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:08,629 INFO L85 PathProgramCache]: Analyzing trace with hash 492844996, now seen corresponding path program 1 times [2025-03-04 10:26:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672050447] [2025-03-04 10:26:08,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:08,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:08,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:26:08,640 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,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,690 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,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:08,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672050447] [2025-03-04 10:26:08,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672050447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:08,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:08,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:26:08,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768802026] [2025-03-04 10:26:08,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:08,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:08,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:08,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:08,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:08,694 INFO L87 Difference]: Start difference. First operand 129 states and 168 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,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:08,738 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2025-03-04 10:26:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:08,740 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,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:08,741 INFO L225 Difference]: With dead ends: 129 [2025-03-04 10:26:08,741 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 10:26:08,741 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,742 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:08,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 177 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:08,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 10:26:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-04 10:26:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 121 states have internal predecessors, (158), 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,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 166 transitions. [2025-03-04 10:26:08,752 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 166 transitions. Word has length 14 [2025-03-04 10:26:08,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:08,752 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 166 transitions. [2025-03-04 10:26:08,752 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,752 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2025-03-04 10:26:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:26:08,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:08,753 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,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:26:08,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:08,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash 492858901, now seen corresponding path program 1 times [2025-03-04 10:26:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:08,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345138726] [2025-03-04 10:26:08,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:08,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:08,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:26:08,760 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,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,796 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,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345138726] [2025-03-04 10:26:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345138726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:08,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:08,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:08,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120907838] [2025-03-04 10:26:08,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:08,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:08,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:08,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:08,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:08,798 INFO L87 Difference]: Start difference. First operand 128 states and 166 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,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:08,846 INFO L93 Difference]: Finished difference Result 267 states and 353 transitions. [2025-03-04 10:26:08,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:08,847 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,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:08,848 INFO L225 Difference]: With dead ends: 267 [2025-03-04 10:26:08,848 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 10:26:08,849 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,849 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 12 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:08,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 180 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 10:26:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2025-03-04 10:26:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.4336283185840708) internal successors, (162), 125 states have internal predecessors, (162), 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,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 170 transitions. [2025-03-04 10:26:08,858 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 170 transitions. Word has length 14 [2025-03-04 10:26:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:08,858 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 170 transitions. [2025-03-04 10:26:08,858 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,858 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 170 transitions. [2025-03-04 10:26:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:26:08,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:08,859 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:08,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:26:08,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:08,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1901674316, now seen corresponding path program 1 times [2025-03-04 10:26:08,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:08,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052139373] [2025-03-04 10:26:08,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:08,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:08,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:26:08,867 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,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,929 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,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:08,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052139373] [2025-03-04 10:26:08,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052139373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:08,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891679517] [2025-03-04 10:26:08,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:08,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:08,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:08,933 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,934 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,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:26:08,965 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,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:08,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:08,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:26:08,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:08,998 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,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:08,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891679517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:08,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:08,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 10:26:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815177747] [2025-03-04 10:26:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:09,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:09,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:09,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:09,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:26:09,003 INFO L87 Difference]: Start difference. First operand 132 states and 170 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:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:09,050 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2025-03-04 10:26:09,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:09,050 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:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:09,051 INFO L225 Difference]: With dead ends: 144 [2025-03-04 10:26:09,051 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 10:26:09,052 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:09,052 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 14 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:09,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 173 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:09,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 10:26:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2025-03-04 10:26:09,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 115 states have (on average 1.4260869565217391) internal successors, (164), 127 states have internal predecessors, (164), 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,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2025-03-04 10:26:09,059 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 15 [2025-03-04 10:26:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:09,059 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2025-03-04 10:26:09,059 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:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2025-03-04 10:26:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:26:09,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:09,060 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:09,067 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,264 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,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:09,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:09,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1901092334, now seen corresponding path program 1 times [2025-03-04 10:26:09,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:09,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336477705] [2025-03-04 10:26:09,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:09,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:09,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:26:09,272 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,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:09,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:09,326 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,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:09,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336477705] [2025-03-04 10:26:09,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336477705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:09,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:09,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:09,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342644659] [2025-03-04 10:26:09,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:09,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:09,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:09,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:09,327 INFO L87 Difference]: Start difference. First operand 134 states and 172 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,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:09,417 INFO L93 Difference]: Finished difference Result 288 states and 370 transitions. [2025-03-04 10:26:09,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:26:09,417 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,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:09,418 INFO L225 Difference]: With dead ends: 288 [2025-03-04 10:26:09,418 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 10:26:09,419 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,419 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 114 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:09,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 331 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:09,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 10:26:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2025-03-04 10:26:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 125 states have (on average 1.4) internal successors, (175), 137 states have internal predecessors, (175), 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,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 183 transitions. [2025-03-04 10:26:09,429 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 183 transitions. Word has length 15 [2025-03-04 10:26:09,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:09,429 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 183 transitions. [2025-03-04 10:26:09,429 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,429 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 183 transitions. [2025-03-04 10:26:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:26:09,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:09,430 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,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:26:09,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:09,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:09,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1195679768, now seen corresponding path program 1 times [2025-03-04 10:26:09,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:09,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305954978] [2025-03-04 10:26:09,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:09,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:09,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:26:09,445 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,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:09,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:09,510 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,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:09,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305954978] [2025-03-04 10:26:09,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305954978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:09,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:09,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:09,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036604603] [2025-03-04 10:26:09,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:09,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:09,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:09,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:09,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:09,512 INFO L87 Difference]: Start difference. First operand 144 states and 183 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,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:09,597 INFO L93 Difference]: Finished difference Result 160 states and 200 transitions. [2025-03-04 10:26:09,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:26:09,598 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,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:09,599 INFO L225 Difference]: With dead ends: 160 [2025-03-04 10:26:09,599 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 10:26:09,599 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,600 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 100 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:09,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 337 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 10:26:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2025-03-04 10:26:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 142 states have internal predecessors, (181), 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,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 189 transitions. [2025-03-04 10:26:09,614 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 189 transitions. Word has length 16 [2025-03-04 10:26:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:09,614 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 189 transitions. [2025-03-04 10:26:09,614 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,614 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 189 transitions. [2025-03-04 10:26:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:26:09,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:09,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:09,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:26:09,615 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:09,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:09,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1296009539, now seen corresponding path program 1 times [2025-03-04 10:26:09,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:09,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208115177] [2025-03-04 10:26:09,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:09,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:09,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:26:09,624 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,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:09,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:09,660 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,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:09,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208115177] [2025-03-04 10:26:09,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208115177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:09,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:09,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:26:09,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044294347] [2025-03-04 10:26:09,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:09,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:09,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:09,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:09,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:09,662 INFO L87 Difference]: Start difference. First operand 149 states and 189 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,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:09,689 INFO L93 Difference]: Finished difference Result 149 states and 189 transitions. [2025-03-04 10:26:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:09,690 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,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:09,690 INFO L225 Difference]: With dead ends: 149 [2025-03-04 10:26:09,690 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 10:26:09,691 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,691 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:09,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 10:26:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2025-03-04 10:26:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.3828125) internal successors, (177), 139 states have internal predecessors, (177), 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,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 185 transitions. [2025-03-04 10:26:09,702 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 185 transitions. Word has length 16 [2025-03-04 10:26:09,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:09,702 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 185 transitions. [2025-03-04 10:26:09,702 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,702 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 185 transitions. [2025-03-04 10:26:09,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:26:09,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:09,703 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,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:26:09,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:09,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1521777728, now seen corresponding path program 1 times [2025-03-04 10:26:09,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:09,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685446831] [2025-03-04 10:26:09,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:09,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:09,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:26:09,712 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,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:09,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:09,759 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,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:09,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685446831] [2025-03-04 10:26:09,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685446831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:09,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955058855] [2025-03-04 10:26:09,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:09,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:09,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:09,761 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,763 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,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:26:09,794 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,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:09,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:09,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:26:09,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:09,829 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,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:09,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955058855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:09,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:09,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 10:26:09,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329802412] [2025-03-04 10:26:09,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:09,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:09,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:09,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:09,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:26:09,831 INFO L87 Difference]: Start difference. First operand 146 states and 185 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,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:09,896 INFO L93 Difference]: Finished difference Result 159 states and 205 transitions. [2025-03-04 10:26:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:09,897 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,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:09,897 INFO L225 Difference]: With dead ends: 159 [2025-03-04 10:26:09,898 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 10:26:09,898 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,898 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 8 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:09,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 268 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 10:26:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2025-03-04 10:26:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.3828125) internal successors, (177), 139 states have internal predecessors, (177), 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,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 185 transitions. [2025-03-04 10:26:09,910 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 185 transitions. Word has length 17 [2025-03-04 10:26:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:09,910 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 185 transitions. [2025-03-04 10:26:09,910 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,910 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 185 transitions. [2025-03-04 10:26:09,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:26:09,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:09,911 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:09,920 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,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 10:26:10,120 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:10,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2117405053, now seen corresponding path program 1 times [2025-03-04 10:26:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540965812] [2025-03-04 10:26:10,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:26:10,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:26:10,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:26:10,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540965812] [2025-03-04 10:26:10,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540965812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824142220] [2025-03-04 10:26:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:10,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:10,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:10,160 INFO L87 Difference]: Start difference. First operand 146 states and 185 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:26:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,223 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2025-03-04 10:26:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:10,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 10:26:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,224 INFO L225 Difference]: With dead ends: 164 [2025-03-04 10:26:10,224 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 10:26:10,224 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,225 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 8 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:10,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 184 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 10:26:10,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2025-03-04 10:26:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.375) internal successors, (176), 139 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:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 184 transitions. [2025-03-04 10:26:10,230 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 184 transitions. Word has length 20 [2025-03-04 10:26:10,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,230 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 184 transitions. [2025-03-04 10:26:10,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:26:10,230 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2025-03-04 10:26:10,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:26:10,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,231 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,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:26:10,231 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:10,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1946457089, now seen corresponding path program 1 times [2025-03-04 10:26:10,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268805339] [2025-03-04 10:26:10,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:26:10,239 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,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,279 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,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268805339] [2025-03-04 10:26:10,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268805339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:10,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936969354] [2025-03-04 10:26:10,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:10,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:10,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:10,281 INFO L87 Difference]: Start difference. First operand 146 states and 184 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,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,358 INFO L93 Difference]: Finished difference Result 211 states and 270 transitions. [2025-03-04 10:26:10,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:10,358 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,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,360 INFO L225 Difference]: With dead ends: 211 [2025-03-04 10:26:10,360 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 10:26:10,360 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,360 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 130 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:10,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 271 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:10,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 10:26:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 180. [2025-03-04 10:26:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 172 states have internal predecessors, (223), 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,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 231 transitions. [2025-03-04 10:26:10,367 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 231 transitions. Word has length 24 [2025-03-04 10:26:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,368 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 231 transitions. [2025-03-04 10:26:10,368 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,368 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 231 transitions. [2025-03-04 10:26:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:26:10,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,368 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,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:26:10,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:10,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1947749087, now seen corresponding path program 1 times [2025-03-04 10:26:10,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124994371] [2025-03-04 10:26:10,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:26:10,374 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,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,411 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,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124994371] [2025-03-04 10:26:10,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124994371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:10,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528526668] [2025-03-04 10:26:10,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:10,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:10,412 INFO L87 Difference]: Start difference. First operand 180 states and 231 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:26:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,510 INFO L93 Difference]: Finished difference Result 202 states and 258 transitions. [2025-03-04 10:26:10,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:10,510 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,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,511 INFO L225 Difference]: With dead ends: 202 [2025-03-04 10:26:10,511 INFO L226 Difference]: Without dead ends: 200 [2025-03-04 10:26:10,511 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,511 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 123 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:10,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 275 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-04 10:26:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 175. [2025-03-04 10:26:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 167 states have internal predecessors, (215), 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,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 223 transitions. [2025-03-04 10:26:10,519 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 223 transitions. Word has length 24 [2025-03-04 10:26:10,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,519 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 223 transitions. [2025-03-04 10:26:10,519 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,520 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 223 transitions. [2025-03-04 10:26:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:26:10,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,521 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:10,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:26:10,521 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:10,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,521 INFO L85 PathProgramCache]: Analyzing trace with hash 64173705, now seen corresponding path program 1 times [2025-03-04 10:26:10,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926574733] [2025-03-04 10:26:10,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:26:10,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:26:10,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:26:10,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926574733] [2025-03-04 10:26:10,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926574733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:10,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376904304] [2025-03-04 10:26:10,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:10,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:10,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:10,576 INFO L87 Difference]: Start difference. First operand 175 states and 223 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,639 INFO L93 Difference]: Finished difference Result 193 states and 248 transitions. [2025-03-04 10:26:10,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:10,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 31 [2025-03-04 10:26:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,640 INFO L225 Difference]: With dead ends: 193 [2025-03-04 10:26:10,640 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 10:26:10,640 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,640 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 129 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:10,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 264 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 10:26:10,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 164. [2025-03-04 10:26:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 147 states have (on average 1.3673469387755102) internal successors, (201), 156 states have internal predecessors, (201), 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,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2025-03-04 10:26:10,646 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 31 [2025-03-04 10:26:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,647 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2025-03-04 10:26:10,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2025-03-04 10:26:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:26:10,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,647 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:10,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:26:10,647 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:10,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash 65465703, now seen corresponding path program 1 times [2025-03-04 10:26:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49742719] [2025-03-04 10:26:10,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:26:10,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:26:10,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:26:10,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49742719] [2025-03-04 10:26:10,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49742719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:10,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414438109] [2025-03-04 10:26:10,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:10,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:10,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:10,691 INFO L87 Difference]: Start difference. First operand 164 states and 209 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:10,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,759 INFO L93 Difference]: Finished difference Result 184 states and 236 transitions. [2025-03-04 10:26:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:10,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 31 [2025-03-04 10:26:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,760 INFO L225 Difference]: With dead ends: 184 [2025-03-04 10:26:10,761 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 10:26:10,761 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,761 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 122 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:10,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 266 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 10:26:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 157. [2025-03-04 10:26:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 142 states have (on average 1.3591549295774648) internal successors, (193), 149 states have internal predecessors, (193), 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,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 201 transitions. [2025-03-04 10:26:10,769 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 201 transitions. Word has length 31 [2025-03-04 10:26:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,769 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 201 transitions. [2025-03-04 10:26:10,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 201 transitions. [2025-03-04 10:26:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 10:26:10,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,771 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:10,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:26:10,771 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:10,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,771 INFO L85 PathProgramCache]: Analyzing trace with hash 642974842, now seen corresponding path program 1 times [2025-03-04 10:26:10,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021154857] [2025-03-04 10:26:10,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:26:10,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:26:10,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:26:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021154857] [2025-03-04 10:26:10,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021154857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:10,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242720759] [2025-03-04 10:26:10,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:10,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:10,863 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,865 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,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:26:10,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:26:10,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:26:10,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:26:10,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:10,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242720759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:10,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 10:26:10,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405477671] [2025-03-04 10:26:10,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:10,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:10,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:26:10,942 INFO L87 Difference]: Start difference. First operand 157 states and 201 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:26:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,007 INFO L93 Difference]: Finished difference Result 350 states and 445 transitions. [2025-03-04 10:26:11,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:26:11,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2025-03-04 10:26:11,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,008 INFO L225 Difference]: With dead ends: 350 [2025-03-04 10:26:11,008 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 10:26:11,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:26:11,009 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 18 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:11,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 233 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 10:26:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 162. [2025-03-04 10:26:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 153 states have internal predecessors, (197), 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,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 205 transitions. [2025-03-04 10:26:11,018 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 205 transitions. Word has length 43 [2025-03-04 10:26:11,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,019 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 205 transitions. [2025-03-04 10:26:11,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:26:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 205 transitions. [2025-03-04 10:26:11,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 10:26:11,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,020 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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,026 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,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:11,224 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:11,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash 510926672, now seen corresponding path program 1 times [2025-03-04 10:26:11,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:11,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498650622] [2025-03-04 10:26:11,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:11,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 10:26:11,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 10:26:11,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:26:11,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:11,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498650622] [2025-03-04 10:26:11,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498650622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:11,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482763246] [2025-03-04 10:26:11,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:11,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:11,340 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:11,346 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:11,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 10:26:11,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 10:26:11,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:26:11,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:26:11,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:26:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482763246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:11,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:11,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:26:11,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579441632] [2025-03-04 10:26:11,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:11,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:26:11,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:11,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:26:11,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:26:11,598 INFO L87 Difference]: Start difference. First operand 162 states and 205 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:26:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,741 INFO L93 Difference]: Finished difference Result 480 states and 625 transitions. [2025-03-04 10:26:11,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:26:11,742 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2025-03-04 10:26:11,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,743 INFO L225 Difference]: With dead ends: 480 [2025-03-04 10:26:11,743 INFO L226 Difference]: Without dead ends: 367 [2025-03-04 10:26:11,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:26:11,744 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 173 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:11,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 284 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-04 10:26:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 177. [2025-03-04 10:26:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 161 states have (on average 1.3354037267080745) internal successors, (215), 168 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:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2025-03-04 10:26:11,753 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 52 [2025-03-04 10:26:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,754 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2025-03-04 10:26:11,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:26:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2025-03-04 10:26:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 10:26:11,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,754 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:11,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:26:11,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:26:11,955 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:11,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 872060919, now seen corresponding path program 1 times [2025-03-04 10:26:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:11,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53170435] [2025-03-04 10:26:11,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:11,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:26:11,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 10:26:11,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:26:12,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53170435] [2025-03-04 10:26:12,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53170435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837023996] [2025-03-04 10:26:12,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:12,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:12,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:12,013 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:12,015 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:12,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:26:12,071 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,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:12,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:26:12,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:26:12,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:12,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837023996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:12,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:12,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-04 10:26:12,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730767718] [2025-03-04 10:26:12,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:12,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:12,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:12,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:12,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:12,082 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:26:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:12,117 INFO L93 Difference]: Finished difference Result 316 states and 399 transitions. [2025-03-04 10:26:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:12,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-03-04 10:26:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:12,119 INFO L225 Difference]: With dead ends: 316 [2025-03-04 10:26:12,119 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 10:26:12,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:12,120 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 171 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:12,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 171 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:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 10:26:12,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2025-03-04 10:26:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 166 states have (on average 1.319277108433735) internal successors, (219), 173 states have internal predecessors, (219), 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,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2025-03-04 10:26:12,128 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 53 [2025-03-04 10:26:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:12,128 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2025-03-04 10:26:12,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:26:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2025-03-04 10:26:12,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 10:26:12,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:12,129 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:12,139 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:12,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:26:12,334 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:12,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash 507158808, now seen corresponding path program 1 times [2025-03-04 10:26:12,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:12,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243111814] [2025-03-04 10:26:12,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:12,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:12,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:26:12,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:26:12,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:12,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:26:12,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:12,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243111814] [2025-03-04 10:26:12,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243111814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:12,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120978652] [2025-03-04 10:26:12,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:12,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:12,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:12,440 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:12,441 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:12,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:26:12,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:26:12,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:12,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:26:12,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:26:12,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:26:12,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120978652] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:12,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:12,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2025-03-04 10:26:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231460050] [2025-03-04 10:26:12,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:12,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:26:12,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:12,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:26:12,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:26:12,709 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:26:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:13,018 INFO L93 Difference]: Finished difference Result 381 states and 474 transitions. [2025-03-04 10:26:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:26:13,019 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 54 [2025-03-04 10:26:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:13,021 INFO L225 Difference]: With dead ends: 381 [2025-03-04 10:26:13,021 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 10:26:13,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:26:13,022 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 44 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:13,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 663 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:26:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 10:26:13,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 149. [2025-03-04 10:26:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 133 states have (on average 1.3157894736842106) internal successors, (175), 140 states have internal predecessors, (175), 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,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 183 transitions. [2025-03-04 10:26:13,044 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 183 transitions. Word has length 54 [2025-03-04 10:26:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:13,044 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 183 transitions. [2025-03-04 10:26:13,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:26:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 183 transitions. [2025-03-04 10:26:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:26:13,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:13,045 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:13,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:26:13,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:26:13,245 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:13,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:13,246 INFO L85 PathProgramCache]: Analyzing trace with hash 215577071, now seen corresponding path program 1 times [2025-03-04 10:26:13,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:13,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642192901] [2025-03-04 10:26:13,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:13,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:26:13,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:26:13,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:13,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:26:13,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:13,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642192901] [2025-03-04 10:26:13,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642192901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:13,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505731106] [2025-03-04 10:26:13,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:13,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:13,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:13,361 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:13,363 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:13,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:26:13,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:26:13,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:13,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:13,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:26:13,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:26:13,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:26:13,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505731106] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:13,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:13,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 10:26:13,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797323358] [2025-03-04 10:26:13,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:13,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:26:13,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:13,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:26:13,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:26:13,589 INFO L87 Difference]: Start difference. First operand 149 states and 183 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:26:13,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:13,760 INFO L93 Difference]: Finished difference Result 528 states and 668 transitions. [2025-03-04 10:26:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:26:13,761 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2025-03-04 10:26:13,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:13,762 INFO L225 Difference]: With dead ends: 528 [2025-03-04 10:26:13,762 INFO L226 Difference]: Without dead ends: 411 [2025-03-04 10:26:13,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:26:13,763 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 160 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:13,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 436 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:13,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-04 10:26:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 169. [2025-03-04 10:26:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 160 states have internal predecessors, (199), 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,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 207 transitions. [2025-03-04 10:26:13,773 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 207 transitions. Word has length 60 [2025-03-04 10:26:13,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:13,773 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 207 transitions. [2025-03-04 10:26:13,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:26:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2025-03-04 10:26:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:26:13,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:13,774 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:13,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:13,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:13,975 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:13,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash -41026280, now seen corresponding path program 1 times [2025-03-04 10:26:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:13,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373561841] [2025-03-04 10:26:13,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:13,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:26:13,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:26:13,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:13,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:26:14,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:14,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373561841] [2025-03-04 10:26:14,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373561841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:14,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700111121] [2025-03-04 10:26:14,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:14,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:14,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:14,053 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:14,054 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:14,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:26:14,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:26:14,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:14,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:14,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:26:14,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:26:14,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:14,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700111121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:14,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:14,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 10:26:14,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383776951] [2025-03-04 10:26:14,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:14,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:14,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:14,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:14,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:14,149 INFO L87 Difference]: Start difference. First operand 169 states and 207 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:26:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:14,187 INFO L93 Difference]: Finished difference Result 306 states and 376 transitions. [2025-03-04 10:26:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:14,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2025-03-04 10:26:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:14,189 INFO L225 Difference]: With dead ends: 306 [2025-03-04 10:26:14,189 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 10:26:14,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:14,189 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 8 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:14,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 175 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 10:26:14,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2025-03-04 10:26:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 156 states have internal predecessors, (192), 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,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 200 transitions. [2025-03-04 10:26:14,205 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 200 transitions. Word has length 60 [2025-03-04 10:26:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:14,205 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 200 transitions. [2025-03-04 10:26:14,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:26:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 200 transitions. [2025-03-04 10:26:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 10:26:14,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:14,205 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:14,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:14,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:14,407 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:14,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash -457942163, now seen corresponding path program 1 times [2025-03-04 10:26:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:14,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86460493] [2025-03-04 10:26:14,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:14,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:26:14,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:26:14,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:14,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:26:14,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:14,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86460493] [2025-03-04 10:26:14,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86460493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:14,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084028873] [2025-03-04 10:26:14,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:14,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:14,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:14,537 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:26:14,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:26:14,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:26:14,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:26:14,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 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,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:26:14,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:26:14,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:26:14,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084028873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:14,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:14,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 17 [2025-03-04 10:26:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456016737] [2025-03-04 10:26:14,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:14,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:26:14,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:14,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:26:14,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:26:14,793 INFO L87 Difference]: Start difference. First operand 165 states and 200 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 14 states have internal predecessors, (62), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 10:26:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:14,997 INFO L93 Difference]: Finished difference Result 231 states and 277 transitions. [2025-03-04 10:26:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:26:14,997 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 14 states have internal predecessors, (62), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 61 [2025-03-04 10:26:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:14,998 INFO L225 Difference]: With dead ends: 231 [2025-03-04 10:26:14,999 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 10:26:14,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:26:14,999 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 65 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:14,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1177 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 10:26:15,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2025-03-04 10:26:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 156 states have internal predecessors, (190), 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:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2025-03-04 10:26:15,030 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 61 [2025-03-04 10:26:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:15,030 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2025-03-04 10:26:15,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 14 states have internal predecessors, (62), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 10:26:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2025-03-04 10:26:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 10:26:15,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:15,032 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:15,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:15,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:15,236 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:15,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:15,237 INFO L85 PathProgramCache]: Analyzing trace with hash 990213840, now seen corresponding path program 1 times [2025-03-04 10:26:15,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:15,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061331774] [2025-03-04 10:26:15,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:15,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:15,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 10:26:15,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 10:26:15,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:15,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:26:15,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:15,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061331774] [2025-03-04 10:26:15,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061331774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:15,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:15,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:26:15,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068261606] [2025-03-04 10:26:15,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:15,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:26:15,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:15,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:26:15,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:26:15,330 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:15,371 INFO L93 Difference]: Finished difference Result 217 states and 255 transitions. [2025-03-04 10:26:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:26:15,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 63 [2025-03-04 10:26:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:15,372 INFO L225 Difference]: With dead ends: 217 [2025-03-04 10:26:15,372 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 10:26:15,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:26:15,373 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:15,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 522 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 10:26:15,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2025-03-04 10:26:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 149 states have (on average 1.261744966442953) internal successors, (188), 156 states have internal predecessors, (188), 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:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 196 transitions. [2025-03-04 10:26:15,381 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 196 transitions. Word has length 63 [2025-03-04 10:26:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:15,381 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 196 transitions. [2025-03-04 10:26:15,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 196 transitions. [2025-03-04 10:26:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 10:26:15,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:15,382 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:15,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:26:15,382 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:15,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:15,383 INFO L85 PathProgramCache]: Analyzing trace with hash 926368341, now seen corresponding path program 2 times [2025-03-04 10:26:15,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:15,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27000139] [2025-03-04 10:26:15,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:26:15,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:15,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-04 10:26:15,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 67 statements. [2025-03-04 10:26:15,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:26:15,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 10:26:15,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27000139] [2025-03-04 10:26:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27000139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:15,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:15,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 10:26:15,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760554235] [2025-03-04 10:26:15,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:15,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:26:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:15,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:26:15,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:26:15,656 INFO L87 Difference]: Start difference. First operand 165 states and 196 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:15,834 INFO L93 Difference]: Finished difference Result 201 states and 238 transitions. [2025-03-04 10:26:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:26:15,835 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 67 [2025-03-04 10:26:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:15,837 INFO L225 Difference]: With dead ends: 201 [2025-03-04 10:26:15,837 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 10:26:15,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:26:15,839 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 55 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:15,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 797 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:15,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 10:26:15,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 162. [2025-03-04 10:26:15,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 149 states have (on average 1.2416107382550337) internal successors, (185), 153 states have internal predecessors, (185), 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:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 193 transitions. [2025-03-04 10:26:15,849 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 193 transitions. Word has length 67 [2025-03-04 10:26:15,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:15,849 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 193 transitions. [2025-03-04 10:26:15,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 193 transitions. [2025-03-04 10:26:15,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 10:26:15,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:15,850 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:15,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:26:15,851 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:15,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:15,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1347352424, now seen corresponding path program 1 times [2025-03-04 10:26:15,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:15,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844143637] [2025-03-04 10:26:15,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:15,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:15,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 10:26:15,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 10:26:15,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:15,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 10:26:16,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:16,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844143637] [2025-03-04 10:26:16,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844143637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:16,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233099860] [2025-03-04 10:26:16,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:16,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:16,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:16,005 INFO L229 MonitoredProcess]: Starting monitored process 11 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:16,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:26:16,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 10:26:16,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 10:26:16,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:16,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:16,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:26:16,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:26:16,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:16,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233099860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:16,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:16,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 10 [2025-03-04 10:26:16,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405512241] [2025-03-04 10:26:16,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:16,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:26:16,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:16,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:26:16,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:26:16,116 INFO L87 Difference]: Start difference. First operand 162 states and 193 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:26:16,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:16,194 INFO L93 Difference]: Finished difference Result 220 states and 258 transitions. [2025-03-04 10:26:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:26:16,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2025-03-04 10:26:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:16,196 INFO L225 Difference]: With dead ends: 220 [2025-03-04 10:26:16,196 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 10:26:16,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:26:16,196 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 7 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:16,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 475 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 10:26:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 176. [2025-03-04 10:26:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 160 states have (on average 1.225) internal successors, (196), 165 states have internal predecessors, (196), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 10:26:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 209 transitions. [2025-03-04 10:26:16,206 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 209 transitions. Word has length 68 [2025-03-04 10:26:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:16,206 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 209 transitions. [2025-03-04 10:26:16,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:26:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 209 transitions. [2025-03-04 10:26:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 10:26:16,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:16,207 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:16,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:16,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:26:16,411 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:16,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:16,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1218269705, now seen corresponding path program 1 times [2025-03-04 10:26:16,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:16,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010348623] [2025-03-04 10:26:16,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:16,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:16,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 10:26:16,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 10:26:16,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:16,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 10:26:16,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:16,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010348623] [2025-03-04 10:26:16,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010348623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:16,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:16,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:26:16,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729890745] [2025-03-04 10:26:16,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:16,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:26:16,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:16,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:26:16,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:26:16,710 INFO L87 Difference]: Start difference. First operand 176 states and 209 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:16,788 INFO L93 Difference]: Finished difference Result 189 states and 223 transitions. [2025-03-04 10:26:16,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:26:16,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-03-04 10:26:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:16,789 INFO L225 Difference]: With dead ends: 189 [2025-03-04 10:26:16,789 INFO L226 Difference]: Without dead ends: 179 [2025-03-04 10:26:16,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:26:16,790 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 50 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:16,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 509 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-04 10:26:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2025-03-04 10:26:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 160 states have (on average 1.20625) internal successors, (193), 163 states have internal predecessors, (193), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 10:26:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 206 transitions. [2025-03-04 10:26:16,803 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 206 transitions. Word has length 68 [2025-03-04 10:26:16,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:16,804 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 206 transitions. [2025-03-04 10:26:16,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:16,805 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 206 transitions. [2025-03-04 10:26:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 10:26:16,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:16,805 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:16,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 10:26:16,806 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:16,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash 888344884, now seen corresponding path program 1 times [2025-03-04 10:26:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:16,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371448153] [2025-03-04 10:26:16,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:16,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:16,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 10:26:16,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 10:26:16,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:16,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 10:26:16,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:16,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371448153] [2025-03-04 10:26:16,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371448153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:16,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:16,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:16,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559948024] [2025-03-04 10:26:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:16,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:16,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:16,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:16,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:16,861 INFO L87 Difference]: Start difference. First operand 174 states and 206 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:16,906 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2025-03-04 10:26:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:16,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 69 [2025-03-04 10:26:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:16,907 INFO L225 Difference]: With dead ends: 174 [2025-03-04 10:26:16,907 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 10:26:16,907 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:16,908 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 28 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:16,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 196 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 10:26:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-04 10:26:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 160 states have (on average 1.2) internal successors, (192), 162 states have internal predecessors, (192), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 10:26:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 205 transitions. [2025-03-04 10:26:16,925 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 205 transitions. Word has length 69 [2025-03-04 10:26:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:16,925 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 205 transitions. [2025-03-04 10:26:16,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 205 transitions. [2025-03-04 10:26:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 10:26:16,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:16,927 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:16,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 10:26:16,928 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:16,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1768887701, now seen corresponding path program 1 times [2025-03-04 10:26:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:16,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786231327] [2025-03-04 10:26:16,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:16,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:16,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:26:16,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:26:16,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:16,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:26:17,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786231327] [2025-03-04 10:26:17,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786231327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855868564] [2025-03-04 10:26:17,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:17,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:17,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:17,009 INFO L229 MonitoredProcess]: Starting monitored process 12 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:17,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:26:17,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:26:17,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:26:17,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:17,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:17,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:26:17,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:26:17,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:17,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855868564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:17,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:17,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-03-04 10:26:17,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370930001] [2025-03-04 10:26:17,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:17,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:26:17,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:17,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:26:17,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:26:17,156 INFO L87 Difference]: Start difference. First operand 173 states and 205 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:26:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:17,245 INFO L93 Difference]: Finished difference Result 211 states and 246 transitions. [2025-03-04 10:26:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:26:17,245 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 70 [2025-03-04 10:26:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:17,246 INFO L225 Difference]: With dead ends: 211 [2025-03-04 10:26:17,246 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 10:26:17,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:26:17,247 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 11 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:17,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 516 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 10:26:17,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 183. [2025-03-04 10:26:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 170 states have (on average 1.1941176470588235) internal successors, (203), 172 states have internal predecessors, (203), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 10:26:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 216 transitions. [2025-03-04 10:26:17,256 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 216 transitions. Word has length 70 [2025-03-04 10:26:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:17,256 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 216 transitions. [2025-03-04 10:26:17,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:26:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2025-03-04 10:26:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 10:26:17,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:17,257 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:17,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:17,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:26:17,461 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:17,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:17,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1282672244, now seen corresponding path program 1 times [2025-03-04 10:26:17,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:17,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862842470] [2025-03-04 10:26:17,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:17,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:17,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:26:17,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:26:17,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:17,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:26:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:17,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862842470] [2025-03-04 10:26:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862842470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:17,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944946155] [2025-03-04 10:26:17,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:17,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:17,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:17,538 INFO L229 MonitoredProcess]: Starting monitored process 13 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:17,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:26:17,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:26:17,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:26:17,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:17,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:17,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 10:26:17,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:26:17,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:17,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944946155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:17,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:17,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2025-03-04 10:26:17,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374420514] [2025-03-04 10:26:17,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:17,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:26:17,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:17,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:26:17,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:26:17,711 INFO L87 Difference]: Start difference. First operand 183 states and 216 transitions. Second operand has 12 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:26:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:17,843 INFO L93 Difference]: Finished difference Result 196 states and 229 transitions. [2025-03-04 10:26:17,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:26:17,844 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 72 [2025-03-04 10:26:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:17,844 INFO L225 Difference]: With dead ends: 196 [2025-03-04 10:26:17,845 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 10:26:17,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:26:17,845 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 27 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:17,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 584 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:17,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 10:26:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2025-03-04 10:26:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 177 states have (on average 1.1864406779661016) internal successors, (210), 179 states have internal predecessors, (210), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 10:26:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 223 transitions. [2025-03-04 10:26:17,854 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 223 transitions. Word has length 72 [2025-03-04 10:26:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:17,854 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 223 transitions. [2025-03-04 10:26:17,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:26:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 223 transitions. [2025-03-04 10:26:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 10:26:17,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:17,855 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:17,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:26:18,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 10:26:18,056 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:18,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash -834006649, now seen corresponding path program 1 times [2025-03-04 10:26:18,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:18,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003128665] [2025-03-04 10:26:18,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:18,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:18,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:26:18,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:26:18,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:18,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:26:18,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:18,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003128665] [2025-03-04 10:26:18,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003128665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:18,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414773904] [2025-03-04 10:26:18,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:18,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:18,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:18,140 INFO L229 MonitoredProcess]: Starting monitored process 14 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:18,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:26:18,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:26:18,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:26:18,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:18,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:18,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:26:18,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:26:18,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-04 10:26:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414773904] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:18,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:18,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 8] total 21 [2025-03-04 10:26:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519997381] [2025-03-04 10:26:18,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:18,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:26:18,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:18,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:26:18,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:26:18,435 INFO L87 Difference]: Start difference. First operand 190 states and 223 transitions. Second operand has 21 states, 21 states have (on average 4.380952380952381) internal successors, (92), 18 states have internal predecessors, (92), 5 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-04 10:26:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:18,753 INFO L93 Difference]: Finished difference Result 409 states and 478 transitions. [2025-03-04 10:26:18,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:26:18,754 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.380952380952381) internal successors, (92), 18 states have internal predecessors, (92), 5 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) Word has length 77 [2025-03-04 10:26:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:18,755 INFO L225 Difference]: With dead ends: 409 [2025-03-04 10:26:18,755 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 10:26:18,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:26:18,756 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 92 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:18,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 861 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:26:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 10:26:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 196. [2025-03-04 10:26:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 183 states have (on average 1.174863387978142) internal successors, (215), 184 states have internal predecessors, (215), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 10:26:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 228 transitions. [2025-03-04 10:26:18,767 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 228 transitions. Word has length 77 [2025-03-04 10:26:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:18,767 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 228 transitions. [2025-03-04 10:26:18,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.380952380952381) internal successors, (92), 18 states have internal predecessors, (92), 5 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-04 10:26:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 228 transitions. [2025-03-04 10:26:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 10:26:18,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:18,768 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:18,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:26:18,969 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:18,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:18,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1893409077, now seen corresponding path program 1 times [2025-03-04 10:26:18,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:18,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137923029] [2025-03-04 10:26:18,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:18,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 10:26:18,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:26:18,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:18,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 10:26:19,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:19,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137923029] [2025-03-04 10:26:19,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137923029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:19,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:19,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:26:19,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434297073] [2025-03-04 10:26:19,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:19,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:26:19,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:19,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:26:19,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:26:19,242 INFO L87 Difference]: Start difference. First operand 196 states and 228 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:19,292 INFO L93 Difference]: Finished difference Result 196 states and 228 transitions. [2025-03-04 10:26:19,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:19,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 82 [2025-03-04 10:26:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:19,292 INFO L225 Difference]: With dead ends: 196 [2025-03-04 10:26:19,292 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:26:19,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:26:19,293 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 56 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:19,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 199 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:26:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:26:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:26:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:26:19,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2025-03-04 10:26:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:19,294 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:26:19,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:26:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:26:19,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:26:19,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-04 10:26:19,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-04 10:26:19,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 10:26:19,302 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:19,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:26:49,084 WARN L286 SmtUtils]: Spent 28.94s on a formula simplification. DAG size of input: 87 DAG size of output: 151 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-04 10:27:29,006 WARN L286 SmtUtils]: Spent 28.28s on a formula simplification. DAG size of input: 87 DAG size of output: 151 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-04 10:27:31,671 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:27:31,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:27:31 BoogieIcfgContainer [2025-03-04 10:27:31,684 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:27:31,685 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:27:31,685 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:27:31,685 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:27:31,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:26:08" (3/4) ... [2025-03-04 10:27:31,688 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:27:31,691 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure base2flt [2025-03-04 10:27:31,691 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:27:31,699 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 10:27:31,699 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 10:27:31,699 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:27:31,699 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:27:31,716 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (((((((0 <= ((long long) 128 + e)) && ((m % 2) == 0)) && (((long long) e + 1) <= 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) || ((m == \old(m)) && (e == 0))) || (\old(e) != 0))) && (e <= \old(e))) && (m <= 33554431)) [2025-03-04 10:27:31,716 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < \old(m)) || (\old(e) != 0)) && (0 <= ((long long) 128 + \old(e)))) && (\old(e) <= e)) && (e <= 127)) && (\old(m) != 1)) [2025-03-04 10:27:31,735 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < \old(m)) || (\old(e) != 0)) && (0 <= ((long long) 128 + \old(e)))) && (\old(e) <= e)) && (e <= 127)) && (\old(m) != 1)) [2025-03-04 10:27:31,735 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (((((((0 <= ((long long) 128 + e)) && ((m % 2) == 0)) && (((long long) e + 1) <= 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) || ((m == \old(m)) && (e == 0))) || (\old(e) != 0))) && (e <= \old(e))) && (m <= 33554431)) [2025-03-04 10:27:31,762 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:27:31,762 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:27:31,762 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:27:31,763 INFO L158 Benchmark]: Toolchain (without parser) took 84393.59ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 112.2MB in the beginning and 529.6MB in the end (delta: -417.4MB). Peak memory consumption was 274.2MB. Max. memory is 16.1GB. [2025-03-04 10:27:31,763 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:27:31,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.24ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 98.6MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:27:31,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.66ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:27:31,764 INFO L158 Benchmark]: Boogie Preprocessor took 30.20ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 95.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:27:31,765 INFO L158 Benchmark]: IcfgBuilder took 420.78ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 70.1MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:27:31,765 INFO L158 Benchmark]: TraceAbstraction took 83565.11ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 69.6MB in the beginning and 537.8MB in the end (delta: -468.2MB). Peak memory consumption was 460.6MB. Max. memory is 16.1GB. [2025-03-04 10:27:31,765 INFO L158 Benchmark]: Witness Printer took 77.13ms. Allocated memory is still 838.9MB. Free memory was 537.8MB in the beginning and 529.6MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:27:31,766 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.77ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.24ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 98.6MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.66ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.20ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 95.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 420.78ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 70.1MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 83565.11ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 69.6MB in the beginning and 537.8MB in the end (delta: -468.2MB). Peak memory consumption was 460.6MB. Max. memory is 16.1GB. * Witness Printer took 77.13ms. Allocated memory is still 838.9MB. Free memory was 537.8MB in the beginning and 529.6MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 175]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 175]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 111 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1667 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1648 mSDsluCounter, 11046 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8565 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3449 IncrementalHoareTripleChecker+Invalid, 3562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 2481 mSDtfsCounter, 3449 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1173 GetRequests, 963 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=28, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 896 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1967 NumberOfCodeBlocks, 1928 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2224 ConstructedInterpolants, 0 QuantifiedInterpolants, 4345 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2027 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 47 InterpolantComputations, 24 PerfectInterpolantSequences, 1020/1201 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 37]: Location Invariant Derived location invariant: ((((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (((((((0 <= ((long long) 128 + e)) && ((m % 2) == 0)) && (((long long) e + 1) <= 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) || ((m == \old(m)) && (e == 0))) || (\old(e) != 0))) && (e <= \old(e))) && (m <= 33554431)) - InvariantResult [Line: 57]: Location Invariant Derived location invariant: ((((((0 < \old(m)) || (\old(e) != 0)) && (0 <= ((long long) 128 + \old(e)))) && (\old(e) <= e)) && (e <= 127)) && (\old(m) != 1)) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:27:31,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE