./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:26:07,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:26:07,413 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:07,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:26:07,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:26:07,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:26:07,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:26:07,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:26:07,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:26:07,432 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:26:07,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:26:07,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:26:07,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:26:07,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:26:07,433 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:26:07,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:26:07,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:26:07,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:26:07,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:26:07,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:26:07,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:26:07,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:26:07,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:26:07,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:26:07,434 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:26:07,434 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:26:07,434 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:26:07,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:26:07,434 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:26:07,434 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:26:07,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:26:07,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:26:07,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:26:07,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:26:07,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:26:07,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:26:07,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:26:07,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:26:07,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:26:07,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:26:07,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:26:07,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:26:07,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:26:07,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:26:07,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:26:07,436 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 -> 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 [2025-03-04 10:26:07,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:26:07,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:26:07,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:26:07,655 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:26:07,656 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:26:07,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2025-03-04 10:26:08,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab206005/bf29d36cdd0c452fb1bd263642dffcad/FLAGe9fca4c59 [2025-03-04 10:26:09,087 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:26:09,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2025-03-04 10:26:09,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab206005/bf29d36cdd0c452fb1bd263642dffcad/FLAGe9fca4c59 [2025-03-04 10:26:09,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab206005/bf29d36cdd0c452fb1bd263642dffcad [2025-03-04 10:26:09,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:26:09,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:26:09,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:26:09,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:26:09,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:26:09,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:26:09" (1/1) ... [2025-03-04 10:26:09,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644a9303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:09, skipping insertion in model container [2025-03-04 10:26:09,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:26:09" (1/1) ... [2025-03-04 10:26:09,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:26:09,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:26:09,576 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:26:09,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:26:09,613 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:26:09,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:09 WrapperNode [2025-03-04 10:26:09,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:26:09,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:26:09,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:26:09,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:26:09,618 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:09" (1/1) ... [2025-03-04 10:26:09,622 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:09" (1/1) ... [2025-03-04 10:26:09,640 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 166 [2025-03-04 10:26:09,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:26:09,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:26:09,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:26:09,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:26:09,648 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:09" (1/1) ... [2025-03-04 10:26:09,648 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:09" (1/1) ... [2025-03-04 10:26:09,649 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:09" (1/1) ... [2025-03-04 10:26:09,656 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:09,657 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:09" (1/1) ... [2025-03-04 10:26:09,657 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:09" (1/1) ... [2025-03-04 10:26:09,663 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:09" (1/1) ... [2025-03-04 10:26:09,664 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:09" (1/1) ... [2025-03-04 10:26:09,664 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:09" (1/1) ... [2025-03-04 10:26:09,665 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:09" (1/1) ... [2025-03-04 10:26:09,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:26:09,671 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:26:09,671 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:26:09,671 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:26:09,671 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:09" (1/1) ... [2025-03-04 10:26:09,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:26:09,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:09,695 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:09,699 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:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:26:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:26:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-04 10:26:09,713 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-04 10:26:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:26:09,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:26:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:26:09,713 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:26:09,764 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:26:09,765 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:26:10,105 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2025-03-04 10:26:10,105 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:26:10,129 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:26:10,129 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:26:10,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:26:10 BoogieIcfgContainer [2025-03-04 10:26:10,129 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:26:10,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:26:10,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:26:10,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:26:10,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:26:09" (1/3) ... [2025-03-04 10:26:10,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90e6c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:26:10, skipping insertion in model container [2025-03-04 10:26:10,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:09" (2/3) ... [2025-03-04 10:26:10,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90e6c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:26:10, skipping insertion in model container [2025-03-04 10:26:10,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:26:10" (3/3) ... [2025-03-04 10:26:10,137 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2025-03-04 10:26:10,147 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:26:10,149 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_3a.c.cil.c that has 3 procedures, 110 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-04 10:26:10,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:26:10,208 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;@248ea2da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:26:10,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 10:26:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 103 states have internal predecessors, (135), 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:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:26:10,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:10,218 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:10,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1333900040, now seen corresponding path program 1 times [2025-03-04 10:26:10,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291700986] [2025-03-04 10:26:10,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:26:10,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:26:10,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:10,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291700986] [2025-03-04 10:26:10,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291700986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:10,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688389535] [2025-03-04 10:26:10,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:10,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:10,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:10,458 INFO L87 Difference]: Start difference. First operand has 110 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 103 states have internal predecessors, (135), 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:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,591 INFO L93 Difference]: Finished difference Result 265 states and 370 transitions. [2025-03-04 10:26:10,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:10,593 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:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,600 INFO L225 Difference]: With dead ends: 265 [2025-03-04 10:26:10,600 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 10:26:10,603 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:10,605 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 85 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 343 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:10,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 343 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:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 10:26:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2025-03-04 10:26:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 105 states have (on average 1.4666666666666666) internal successors, (154), 118 states have internal predecessors, (154), 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,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 162 transitions. [2025-03-04 10:26:10,643 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 162 transitions. Word has length 9 [2025-03-04 10:26:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,644 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 162 transitions. [2025-03-04 10:26:10,644 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:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2025-03-04 10:26:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:26:10,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:10,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:26:10,646 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:10,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1162723909, now seen corresponding path program 1 times [2025-03-04 10:26:10,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320476008] [2025-03-04 10:26:10,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,646 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 14 statements into 1 equivalence classes. [2025-03-04 10:26:10,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:26:10,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,716 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:10,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320476008] [2025-03-04 10:26:10,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320476008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:26:10,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898425685] [2025-03-04 10:26:10,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:10,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:10,720 INFO L87 Difference]: Start difference. First operand 125 states and 162 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:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,766 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2025-03-04 10:26:10,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:10,766 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:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,767 INFO L225 Difference]: With dead ends: 125 [2025-03-04 10:26:10,767 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 10:26:10,767 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:10,768 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 165 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:10,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 165 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:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 10:26:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-04 10:26:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 117 states have internal predecessors, (152), 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,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 160 transitions. [2025-03-04 10:26:10,775 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 160 transitions. Word has length 14 [2025-03-04 10:26:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,776 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 160 transitions. [2025-03-04 10:26:10,776 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:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 160 transitions. [2025-03-04 10:26:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:26:10,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:10,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:26:10,777 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:10,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1162737814, now seen corresponding path program 1 times [2025-03-04 10:26:10,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247332670] [2025-03-04 10:26:10,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:26:10,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:26:10,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247332670] [2025-03-04 10:26:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247332670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:10,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:10,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:10,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135921113] [2025-03-04 10:26:10,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:10,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:10,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:10,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:10,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:10,830 INFO L87 Difference]: Start difference. First operand 124 states and 160 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:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:10,872 INFO L93 Difference]: Finished difference Result 259 states and 341 transitions. [2025-03-04 10:26:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:10,873 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:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:10,875 INFO L225 Difference]: With dead ends: 259 [2025-03-04 10:26:10,875 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 10:26:10,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:10,876 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 168 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:10,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 168 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:10,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 10:26:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2025-03-04 10:26:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 109 states have (on average 1.4311926605504588) internal successors, (156), 121 states have internal predecessors, (156), 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,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 164 transitions. [2025-03-04 10:26:10,886 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 164 transitions. Word has length 14 [2025-03-04 10:26:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:10,887 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 164 transitions. [2025-03-04 10:26:10,887 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:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 164 transitions. [2025-03-04 10:26:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:26:10,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:10,888 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:10,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:26:10,888 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:10,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1684702803, now seen corresponding path program 1 times [2025-03-04 10:26:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324964701] [2025-03-04 10:26:10,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:10,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:26:10,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:26:10,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,938 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:10,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:10,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324964701] [2025-03-04 10:26:10,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324964701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:10,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802497710] [2025-03-04 10:26:10,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:10,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:10,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:10,944 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:10,945 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:10,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:26:10,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:26:10,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:10,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:10,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:26:10,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:11,006 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:11,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:11,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802497710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:11,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:11,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 10:26:11,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389173930] [2025-03-04 10:26:11,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:11,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:11,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:11,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:11,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:26:11,008 INFO L87 Difference]: Start difference. First operand 128 states and 164 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:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,062 INFO L93 Difference]: Finished difference Result 140 states and 181 transitions. [2025-03-04 10:26:11,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:11,063 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:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,064 INFO L225 Difference]: With dead ends: 140 [2025-03-04 10:26:11,064 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 10:26:11,064 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:11,065 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 14 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 161 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:11,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 161 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:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 10:26:11,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2025-03-04 10:26:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 123 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:11,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2025-03-04 10:26:11,073 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 15 [2025-03-04 10:26:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,074 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2025-03-04 10:26:11,074 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:11,074 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2025-03-04 10:26:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:26:11,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,075 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:11,081 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:11,279 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:11,279 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:11,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:11,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1685284785, now seen corresponding path program 1 times [2025-03-04 10:26:11,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:11,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722821310] [2025-03-04 10:26:11,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:11,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:26:11,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:26:11,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,358 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:11,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:11,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722821310] [2025-03-04 10:26:11,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722821310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:11,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:11,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:11,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747279161] [2025-03-04 10:26:11,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:11,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:11,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:11,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:11,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:11,360 INFO L87 Difference]: Start difference. First operand 130 states and 166 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:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,455 INFO L93 Difference]: Finished difference Result 280 states and 358 transitions. [2025-03-04 10:26:11,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:26:11,456 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:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,457 INFO L225 Difference]: With dead ends: 280 [2025-03-04 10:26:11,457 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 10:26:11,458 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:11,460 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 114 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 307 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:11,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 307 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:11,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 10:26:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2025-03-04 10:26:11,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 121 states have (on average 1.396694214876033) internal successors, (169), 133 states have internal predecessors, (169), 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:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2025-03-04 10:26:11,475 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 15 [2025-03-04 10:26:11,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,475 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2025-03-04 10:26:11,475 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:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2025-03-04 10:26:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:26:11,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,478 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:11,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:26:11,478 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:11,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:11,478 INFO L85 PathProgramCache]: Analyzing trace with hash 704220761, now seen corresponding path program 1 times [2025-03-04 10:26:11,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:11,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501132083] [2025-03-04 10:26:11,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:11,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:26:11,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:26:11,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,551 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:11,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501132083] [2025-03-04 10:26:11,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501132083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:11,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:11,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:11,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993576913] [2025-03-04 10:26:11,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:11,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:11,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:11,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:11,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:11,553 INFO L87 Difference]: Start difference. First operand 140 states and 177 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:11,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,644 INFO L93 Difference]: Finished difference Result 156 states and 194 transitions. [2025-03-04 10:26:11,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:26:11,645 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:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,645 INFO L225 Difference]: With dead ends: 156 [2025-03-04 10:26:11,646 INFO L226 Difference]: Without dead ends: 155 [2025-03-04 10:26:11,646 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:11,646 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 100 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 313 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:11,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 313 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:11,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-04 10:26:11,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2025-03-04 10:26:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 126 states have (on average 1.3888888888888888) internal successors, (175), 138 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:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 183 transitions. [2025-03-04 10:26:11,662 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 183 transitions. Word has length 16 [2025-03-04 10:26:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,662 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 183 transitions. [2025-03-04 10:26:11,662 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:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 183 transitions. [2025-03-04 10:26:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:26:11,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,663 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:11,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:26:11,663 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:11,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash 804550532, now seen corresponding path program 1 times [2025-03-04 10:26:11,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:11,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137298841] [2025-03-04 10:26:11,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:11,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:26:11,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:26:11,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,699 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:11,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:11,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137298841] [2025-03-04 10:26:11,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137298841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:11,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:11,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:26:11,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525522719] [2025-03-04 10:26:11,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:11,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:11,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:11,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:11,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:11,701 INFO L87 Difference]: Start difference. First operand 145 states and 183 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:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,753 INFO L93 Difference]: Finished difference Result 145 states and 183 transitions. [2025-03-04 10:26:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:11,753 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:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,754 INFO L225 Difference]: With dead ends: 145 [2025-03-04 10:26:11,754 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 10:26:11,754 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:11,755 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 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:11,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 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:11,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 10:26:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2025-03-04 10:26:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 135 states have internal predecessors, (171), 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:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 179 transitions. [2025-03-04 10:26:11,761 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 179 transitions. Word has length 16 [2025-03-04 10:26:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,761 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 179 transitions. [2025-03-04 10:26:11,761 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:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 179 transitions. [2025-03-04 10:26:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:26:11,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,762 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:11,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:26:11,762 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:11,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:11,762 INFO L85 PathProgramCache]: Analyzing trace with hash -828549601, now seen corresponding path program 1 times [2025-03-04 10:26:11,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:11,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190665087] [2025-03-04 10:26:11,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:11,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:26:11,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:26:11,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,813 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:11,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:11,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190665087] [2025-03-04 10:26:11,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190665087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:11,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371755570] [2025-03-04 10:26:11,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:11,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:11,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:11,816 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:11,818 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:11,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:26:11,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:26:11,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:11,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:11,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:26:11,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:11,870 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:11,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:11,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371755570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:11,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:11,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 10:26:11,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499667143] [2025-03-04 10:26:11,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:11,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:11,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:11,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:26:11,871 INFO L87 Difference]: Start difference. First operand 142 states and 179 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:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:11,937 INFO L93 Difference]: Finished difference Result 155 states and 199 transitions. [2025-03-04 10:26:11,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:11,937 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:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:11,938 INFO L225 Difference]: With dead ends: 155 [2025-03-04 10:26:11,938 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 10:26:11,939 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:11,939 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 250 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:11,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 250 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:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 10:26:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142. [2025-03-04 10:26:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 135 states have internal predecessors, (171), 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:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 179 transitions. [2025-03-04 10:26:11,945 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 179 transitions. Word has length 17 [2025-03-04 10:26:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:11,945 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 179 transitions. [2025-03-04 10:26:11,945 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:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 179 transitions. [2025-03-04 10:26:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:26:11,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:11,946 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:11,952 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:12,146 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:12,147 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:12,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:12,147 INFO L85 PathProgramCache]: Analyzing trace with hash 72806206, now seen corresponding path program 1 times [2025-03-04 10:26:12,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:12,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969421668] [2025-03-04 10:26:12,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:12,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:12,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:26:12,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:26:12,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:12,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,173 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:12,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969421668] [2025-03-04 10:26:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969421668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:12,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:12,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:12,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57065461] [2025-03-04 10:26:12,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:12,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:12,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:12,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:12,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:12,175 INFO L87 Difference]: Start difference. First operand 142 states and 179 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:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:12,215 INFO L93 Difference]: Finished difference Result 160 states and 204 transitions. [2025-03-04 10:26:12,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:12,216 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:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:12,217 INFO L225 Difference]: With dead ends: 160 [2025-03-04 10:26:12,217 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 10:26:12,217 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:12,217 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 8 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 172 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:12,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 172 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 10:26:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 142. [2025-03-04 10:26:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.3709677419354838) internal successors, (170), 135 states have internal predecessors, (170), 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:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2025-03-04 10:26:12,223 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 20 [2025-03-04 10:26:12,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:12,223 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2025-03-04 10:26:12,223 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:12,223 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2025-03-04 10:26:12,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:26:12,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:12,224 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:12,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:26:12,224 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:12,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:12,224 INFO L85 PathProgramCache]: Analyzing trace with hash 717585954, now seen corresponding path program 1 times [2025-03-04 10:26:12,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:12,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353991625] [2025-03-04 10:26:12,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:12,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:12,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:26:12,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:26:12,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:12,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,262 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:12,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:12,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353991625] [2025-03-04 10:26:12,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353991625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:12,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:12,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:12,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824644357] [2025-03-04 10:26:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:12,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:12,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:12,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:12,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:12,265 INFO L87 Difference]: Start difference. First operand 142 states and 178 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:12,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:12,360 INFO L93 Difference]: Finished difference Result 207 states and 264 transitions. [2025-03-04 10:26:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:12,361 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:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:12,362 INFO L225 Difference]: With dead ends: 207 [2025-03-04 10:26:12,362 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 10:26:12,362 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:12,362 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 124 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 253 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:12,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 253 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:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 10:26:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 176. [2025-03-04 10:26:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 157 states have (on average 1.3821656050955413) internal successors, (217), 168 states have internal predecessors, (217), 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:12,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 225 transitions. [2025-03-04 10:26:12,369 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 225 transitions. Word has length 24 [2025-03-04 10:26:12,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:12,369 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 225 transitions. [2025-03-04 10:26:12,369 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:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 225 transitions. [2025-03-04 10:26:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:26:12,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:12,370 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:12,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:26:12,370 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:12,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash 718877952, now seen corresponding path program 1 times [2025-03-04 10:26:12,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:12,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393200016] [2025-03-04 10:26:12,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:12,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:12,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:26:12,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:26:12,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:12,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,400 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:12,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:12,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393200016] [2025-03-04 10:26:12,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393200016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:12,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:12,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:12,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327551304] [2025-03-04 10:26:12,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:12,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:12,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:12,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:12,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:12,402 INFO L87 Difference]: Start difference. First operand 176 states and 225 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:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:12,481 INFO L93 Difference]: Finished difference Result 198 states and 252 transitions. [2025-03-04 10:26:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:12,482 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:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:12,483 INFO L225 Difference]: With dead ends: 198 [2025-03-04 10:26:12,483 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 10:26:12,483 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:12,483 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 117 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 257 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:12,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 257 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:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 10:26:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2025-03-04 10:26:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 152 states have (on average 1.375) internal successors, (209), 163 states have internal predecessors, (209), 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:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 217 transitions. [2025-03-04 10:26:12,491 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 217 transitions. Word has length 24 [2025-03-04 10:26:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:12,492 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 217 transitions. [2025-03-04 10:26:12,492 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:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 217 transitions. [2025-03-04 10:26:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:26:12,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:12,493 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:12,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:26:12,494 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:12,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2075052105, now seen corresponding path program 1 times [2025-03-04 10:26:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:12,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907644085] [2025-03-04 10:26:12,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:12,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:12,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:26:12,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:26:12,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:12,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,541 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:12,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:12,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907644085] [2025-03-04 10:26:12,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907644085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:12,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:12,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:12,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702339272] [2025-03-04 10:26:12,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:12,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:12,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:12,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:12,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:12,543 INFO L87 Difference]: Start difference. First operand 171 states and 217 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:12,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:12,605 INFO L93 Difference]: Finished difference Result 189 states and 242 transitions. [2025-03-04 10:26:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:12,606 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:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:12,607 INFO L225 Difference]: With dead ends: 189 [2025-03-04 10:26:12,608 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 10:26:12,608 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:12,609 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 123 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 246 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:12,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 246 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 10:26:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 160. [2025-03-04 10:26:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 152 states have internal predecessors, (195), 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:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 203 transitions. [2025-03-04 10:26:12,616 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 203 transitions. Word has length 31 [2025-03-04 10:26:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:12,617 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 203 transitions. [2025-03-04 10:26:12,617 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:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 203 transitions. [2025-03-04 10:26:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:26:12,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:12,618 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:12,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:26:12,618 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:12,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:12,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2076344103, now seen corresponding path program 1 times [2025-03-04 10:26:12,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:12,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83129222] [2025-03-04 10:26:12,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:12,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:12,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:26:12,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:26:12,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:12,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,657 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:12,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:12,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83129222] [2025-03-04 10:26:12,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83129222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:12,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:12,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002533390] [2025-03-04 10:26:12,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:12,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:12,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:12,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:12,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:12,659 INFO L87 Difference]: Start difference. First operand 160 states and 203 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:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:12,727 INFO L93 Difference]: Finished difference Result 180 states and 230 transitions. [2025-03-04 10:26:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:12,727 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:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:12,728 INFO L225 Difference]: With dead ends: 180 [2025-03-04 10:26:12,728 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 10:26:12,728 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:12,728 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 116 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 248 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:12,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 248 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:12,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 10:26:12,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 153. [2025-03-04 10:26:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 138 states have (on average 1.355072463768116) internal successors, (187), 145 states have internal predecessors, (187), 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:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 195 transitions. [2025-03-04 10:26:12,738 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 195 transitions. Word has length 31 [2025-03-04 10:26:12,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:12,738 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 195 transitions. [2025-03-04 10:26:12,739 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:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 195 transitions. [2025-03-04 10:26:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 10:26:12,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:12,740 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] [2025-03-04 10:26:12,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:26:12,740 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:12,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:12,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1509531137, now seen corresponding path program 1 times [2025-03-04 10:26:12,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:12,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449023592] [2025-03-04 10:26:12,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:12,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:12,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:26:12,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:26:12,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:12,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,820 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,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:12,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449023592] [2025-03-04 10:26:12,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449023592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:12,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353872754] [2025-03-04 10:26:12,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:12,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:12,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:12,823 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:12,824 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:12,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:26:12,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:26:12,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:12,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:12,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:26:12,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:12,887 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:12,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:12,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353872754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:12,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:12,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 10:26:12,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988125811] [2025-03-04 10:26:12,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:12,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:12,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:12,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:12,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:26:12,891 INFO L87 Difference]: Start difference. First operand 153 states and 195 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:12,956 INFO L93 Difference]: Finished difference Result 342 states and 433 transitions. [2025-03-04 10:26:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:26:12,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 41 [2025-03-04 10:26:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:12,957 INFO L225 Difference]: With dead ends: 342 [2025-03-04 10:26:12,957 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 10:26:12,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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:12,958 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 18 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 215 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:12,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 215 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:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 10:26:12,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 158. [2025-03-04 10:26:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 149 states have internal predecessors, (191), 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,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 199 transitions. [2025-03-04 10:26:12,967 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 199 transitions. Word has length 41 [2025-03-04 10:26:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:12,967 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 199 transitions. [2025-03-04 10:26:12,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2025-03-04 10:26:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 10:26:12,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:12,968 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] [2025-03-04 10:26:12,974 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:13,168 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:13,169 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:13,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1612817259, now seen corresponding path program 1 times [2025-03-04 10:26:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:13,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075336130] [2025-03-04 10:26:13,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:13,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:26:13,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:26:13,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:13,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:13,244 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:13,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:13,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075336130] [2025-03-04 10:26:13,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075336130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:13,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744175071] [2025-03-04 10:26:13,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:13,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:13,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:13,247 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:13,248 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:13,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:26:13,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:26:13,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:13,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:13,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:26:13,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:13,333 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:13,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:13,445 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:13,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744175071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:13,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:13,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:26:13,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244497541] [2025-03-04 10:26:13,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:13,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:26:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:13,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:26:13,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:26:13,447 INFO L87 Difference]: Start difference. First operand 158 states and 199 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 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,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:13,616 INFO L93 Difference]: Finished difference Result 472 states and 613 transitions. [2025-03-04 10:26:13,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:26:13,616 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 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 50 [2025-03-04 10:26:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:13,618 INFO L225 Difference]: With dead ends: 472 [2025-03-04 10:26:13,618 INFO L226 Difference]: Without dead ends: 363 [2025-03-04 10:26:13,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 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:13,619 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 125 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:13,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 357 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-04 10:26:13,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 173. [2025-03-04 10:26:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 157 states have (on average 1.3312101910828025) internal successors, (209), 164 states have internal predecessors, (209), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:26:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 217 transitions. [2025-03-04 10:26:13,633 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 217 transitions. Word has length 50 [2025-03-04 10:26:13,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:13,633 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 217 transitions. [2025-03-04 10:26:13,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 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,633 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 217 transitions. [2025-03-04 10:26:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:26:13,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:13,634 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] [2025-03-04 10:26:13,643 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:13,834 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:13,837 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:13,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:13,838 INFO L85 PathProgramCache]: Analyzing trace with hash -568584004, now seen corresponding path program 1 times [2025-03-04 10:26:13,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:13,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060340901] [2025-03-04 10:26:13,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:13,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:13,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:26:13,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:26:13,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:13,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:13,879 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:13,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:13,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060340901] [2025-03-04 10:26:13,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060340901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:13,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920856351] [2025-03-04 10:26:13,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:13,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:13,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:13,881 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:26:13,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:26:13,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:26:13,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:26:13,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:13,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:13,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:26:13,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:13,937 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:13,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:13,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920856351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:13,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:13,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-04 10:26:13,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665000159] [2025-03-04 10:26:13,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:13,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:13,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:13,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:13,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:13,938 INFO L87 Difference]: Start difference. First operand 173 states and 217 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:13,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:13,999 INFO L93 Difference]: Finished difference Result 308 states and 387 transitions. [2025-03-04 10:26:14,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:14,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 51 [2025-03-04 10:26:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:14,002 INFO L225 Difference]: With dead ends: 308 [2025-03-04 10:26:14,002 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 10:26:14,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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:14,002 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 159 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:14,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 159 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:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 10:26:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 178. [2025-03-04 10:26:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 162 states have (on average 1.3148148148148149) internal successors, (213), 169 states have internal predecessors, (213), 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,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 221 transitions. [2025-03-04 10:26:14,010 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 221 transitions. Word has length 51 [2025-03-04 10:26:14,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:14,011 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 221 transitions. [2025-03-04 10:26:14,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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,011 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 221 transitions. [2025-03-04 10:26:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 10:26:14,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:14,011 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] [2025-03-04 10:26:14,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:14,212 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:14,213 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:14,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1761257628, now seen corresponding path program 1 times [2025-03-04 10:26:14,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:14,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459596262] [2025-03-04 10:26:14,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:14,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:14,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 10:26:14,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 10:26:14,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:14,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:14,340 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:14,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459596262] [2025-03-04 10:26:14,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459596262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883502301] [2025-03-04 10:26:14,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:14,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:14,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:14,344 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:26:14,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:26:14,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 10:26:14,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:14,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:14,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:14,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:26:14,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:26:14,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:14,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883502301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:14,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:14,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-03-04 10:26:14,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079008956] [2025-03-04 10:26:14,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:14,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:26:14,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:14,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:26:14,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:26:14,448 INFO L87 Difference]: Start difference. First operand 178 states and 221 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:14,498 INFO L93 Difference]: Finished difference Result 229 states and 277 transitions. [2025-03-04 10:26:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 52 [2025-03-04 10:26:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:14,499 INFO L225 Difference]: With dead ends: 229 [2025-03-04 10:26:14,499 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 10:26:14,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:26:14,500 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:14,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 10:26:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 178. [2025-03-04 10:26:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 169 states have internal predecessors, (211), 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,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 219 transitions. [2025-03-04 10:26:14,509 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 219 transitions. Word has length 52 [2025-03-04 10:26:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:14,510 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 219 transitions. [2025-03-04 10:26:14,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 219 transitions. [2025-03-04 10:26:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 10:26:14,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:14,511 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:14,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:14,711 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:14,712 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:14,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:14,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1882941023, now seen corresponding path program 1 times [2025-03-04 10:26:14,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:14,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053995493] [2025-03-04 10:26:14,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:14,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:14,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 10:26:14,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:26:14,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:14,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:14,846 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:14,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:14,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053995493] [2025-03-04 10:26:14,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053995493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:14,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676247225] [2025-03-04 10:26:14,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:14,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:14,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:14,850 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:14,868 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:14,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 10:26:14,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:26:14,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:14,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:14,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:26:14,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:26:15,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:26:15,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676247225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:15,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:15,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 16 [2025-03-04 10:26:15,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227772184] [2025-03-04 10:26:15,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:15,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:26:15,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:15,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:26:15,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:26:15,158 INFO L87 Difference]: Start difference. First operand 178 states and 219 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 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:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:15,442 INFO L93 Difference]: Finished difference Result 360 states and 439 transitions. [2025-03-04 10:26:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:26:15,442 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 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 56 [2025-03-04 10:26:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:15,443 INFO L225 Difference]: With dead ends: 360 [2025-03-04 10:26:15,443 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 10:26:15,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:26:15,444 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 34 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:15,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 912 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:26:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 10:26:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 145. [2025-03-04 10:26:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 129 states have (on average 1.2945736434108528) internal successors, (167), 136 states have internal predecessors, (167), 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,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 175 transitions. [2025-03-04 10:26:15,458 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 175 transitions. Word has length 56 [2025-03-04 10:26:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:15,459 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 175 transitions. [2025-03-04 10:26:15,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 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:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 175 transitions. [2025-03-04 10:26:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 10:26:15,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:15,460 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:15,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:26:15,661 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:15,661 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:15,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:15,662 INFO L85 PathProgramCache]: Analyzing trace with hash 102418553, now seen corresponding path program 1 times [2025-03-04 10:26:15,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:15,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41569632] [2025-03-04 10:26:15,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:15,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:26:15,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:26:15,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:15,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:26:15,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:15,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41569632] [2025-03-04 10:26:15,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41569632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:15,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461606684] [2025-03-04 10:26:15,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:15,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:15,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:15,772 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:15,775 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:15,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:26:15,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:26:15,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:15,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:15,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:26:15,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:15,885 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:26:15,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:26:16,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461606684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:16,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:16,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 10:26:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242941322] [2025-03-04 10:26:16,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:16,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:26:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:16,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:26:16,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:26:16,021 INFO L87 Difference]: Start difference. First operand 145 states and 175 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:16,202 INFO L93 Difference]: Finished difference Result 511 states and 637 transitions. [2025-03-04 10:26:16,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:26:16,202 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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 62 [2025-03-04 10:26:16,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:16,204 INFO L225 Difference]: With dead ends: 511 [2025-03-04 10:26:16,204 INFO L226 Difference]: Without dead ends: 398 [2025-03-04 10:26:16,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 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:16,205 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 153 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:16,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 333 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-04 10:26:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 165. [2025-03-04 10:26:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 156 states have internal predecessors, (191), 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:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 199 transitions. [2025-03-04 10:26:16,218 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 199 transitions. Word has length 62 [2025-03-04 10:26:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:16,218 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 199 transitions. [2025-03-04 10:26:16,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 199 transitions. [2025-03-04 10:26:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 10:26:16,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:16,219 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] [2025-03-04 10:26:16,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:26:16,420 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:16,420 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:16,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:16,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1680265886, now seen corresponding path program 1 times [2025-03-04 10:26:16,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:16,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869369281] [2025-03-04 10:26:16,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:16,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:16,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:26:16,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:26:16,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:16,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 10:26:16,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:16,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869369281] [2025-03-04 10:26:16,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869369281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:16,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483804939] [2025-03-04 10:26:16,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:16,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:16,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:16,520 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:16,521 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:16,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:26:16,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:26:16,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:16,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:16,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:26:16,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:26:16,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:16,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483804939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:16,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:16,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 10:26:16,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644100741] [2025-03-04 10:26:16,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:16,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:16,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:16,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:16,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:16,605 INFO L87 Difference]: Start difference. First operand 165 states and 199 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:16,641 INFO L93 Difference]: Finished difference Result 295 states and 356 transitions. [2025-03-04 10:26:16,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:16,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 62 [2025-03-04 10:26:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:16,645 INFO L225 Difference]: With dead ends: 295 [2025-03-04 10:26:16,645 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 10:26:16,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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:16,646 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 160 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:16,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 160 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:16,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 10:26:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 161. [2025-03-04 10:26:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 145 states have (on average 1.2689655172413794) internal successors, (184), 152 states have internal predecessors, (184), 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:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 192 transitions. [2025-03-04 10:26:16,655 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 192 transitions. Word has length 62 [2025-03-04 10:26:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:16,655 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 192 transitions. [2025-03-04 10:26:16,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 192 transitions. [2025-03-04 10:26:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 10:26:16,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:16,656 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] [2025-03-04 10:26:16,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:26:16,857 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:16,857 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:16,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:16,858 INFO L85 PathProgramCache]: Analyzing trace with hash 202932598, now seen corresponding path program 1 times [2025-03-04 10:26:16,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:16,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269677812] [2025-03-04 10:26:16,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:16,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:16,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 10:26:16,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 10:26:16,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:16,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:16,967 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:16,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:16,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269677812] [2025-03-04 10:26:16,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269677812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:16,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590757774] [2025-03-04 10:26:16,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:16,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:16,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:16,971 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,972 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:17,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 10:26:17,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 10:26:17,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:17,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:17,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:26:17,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:17,158 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,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:17,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590757774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:17,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:17,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2025-03-04 10:26:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557031571] [2025-03-04 10:26:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:17,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:26:17,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:17,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:26:17,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:26:17,160 INFO L87 Difference]: Start difference. First operand 161 states and 192 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:17,276 INFO L93 Difference]: Finished difference Result 251 states and 294 transitions. [2025-03-04 10:26:17,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:26:17,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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 63 [2025-03-04 10:26:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:17,278 INFO L225 Difference]: With dead ends: 251 [2025-03-04 10:26:17,278 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 10:26:17,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:26:17,278 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 69 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:17,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 634 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 10:26:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 181. [2025-03-04 10:26:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 162 states have (on average 1.2530864197530864) internal successors, (203), 170 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,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2025-03-04 10:26:17,291 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 63 [2025-03-04 10:26:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:17,292 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2025-03-04 10:26:17,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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,292 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2025-03-04 10:26:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 10:26:17,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:17,294 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] [2025-03-04 10:26:17,302 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:17,494 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,SelfDestructingSolverStorable20 [2025-03-04 10:26:17,495 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:17,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:17,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1999883957, now seen corresponding path program 1 times [2025-03-04 10:26:17,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:17,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137704121] [2025-03-04 10:26:17,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:17,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 10:26:17,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 10:26:17,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:17,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:17,590 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,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:17,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137704121] [2025-03-04 10:26:17,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137704121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:17,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896070699] [2025-03-04 10:26:17,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:17,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:17,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:17,593 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,603 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,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 10:26:17,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 10:26:17,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:17,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:17,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:26:17,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:17,734 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,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:17,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896070699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:17,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:17,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-03-04 10:26:17,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243107001] [2025-03-04 10:26:17,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:17,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:26:17,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:17,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:26:17,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:26:17,735 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 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,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:17,805 INFO L93 Difference]: Finished difference Result 261 states and 305 transitions. [2025-03-04 10:26:17,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:26:17,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 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 63 [2025-03-04 10:26:17,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:17,808 INFO L225 Difference]: With dead ends: 261 [2025-03-04 10:26:17,808 INFO L226 Difference]: Without dead ends: 222 [2025-03-04 10:26:17,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:26:17,810 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 54 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:17,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 526 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-04 10:26:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 181. [2025-03-04 10:26:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 162 states have (on average 1.2469135802469136) internal successors, (202), 170 states have internal predecessors, (202), 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,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 215 transitions. [2025-03-04 10:26:17,820 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 215 transitions. Word has length 63 [2025-03-04 10:26:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:17,820 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 215 transitions. [2025-03-04 10:26:17,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 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,820 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 215 transitions. [2025-03-04 10:26:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 10:26:17,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:17,822 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] [2025-03-04 10:26:17,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:26:18,022 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,SelfDestructingSolverStorable21 [2025-03-04 10:26:18,023 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:18,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:18,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1749526289, now seen corresponding path program 1 times [2025-03-04 10:26:18,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:18,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78554024] [2025-03-04 10:26:18,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:18,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:18,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 10:26:18,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 10:26:18,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:18,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:18,107 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:18,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:18,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78554024] [2025-03-04 10:26:18,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78554024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:18,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938114498] [2025-03-04 10:26:18,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:18,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:18,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:18,109 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:18,111 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:18,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 10:26:18,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 10:26:18,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:18,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:18,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 10:26:18,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:18,226 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:18,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:18,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938114498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:18,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:18,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2025-03-04 10:26:18,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979256291] [2025-03-04 10:26:18,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:18,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:26:18,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:18,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:26:18,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:26:18,232 INFO L87 Difference]: Start difference. First operand 181 states and 215 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:18,372 INFO L93 Difference]: Finished difference Result 255 states and 296 transitions. [2025-03-04 10:26:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:26:18,372 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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 65 [2025-03-04 10:26:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:18,373 INFO L225 Difference]: With dead ends: 255 [2025-03-04 10:26:18,373 INFO L226 Difference]: Without dead ends: 222 [2025-03-04 10:26:18,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:26:18,374 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 58 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:18,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 635 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:18,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-04 10:26:18,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 181. [2025-03-04 10:26:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 162 states have (on average 1.2407407407407407) internal successors, (201), 170 states have internal predecessors, (201), 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:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 214 transitions. [2025-03-04 10:26:18,382 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 214 transitions. Word has length 65 [2025-03-04 10:26:18,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:18,383 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 214 transitions. [2025-03-04 10:26:18,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 214 transitions. [2025-03-04 10:26:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 10:26:18,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:18,383 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:18,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:18,584 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,SelfDestructingSolverStorable22 [2025-03-04 10:26:18,584 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:18,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2139149507, now seen corresponding path program 1 times [2025-03-04 10:26:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:18,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403364851] [2025-03-04 10:26:18,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:18,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 10:26:18,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 10:26:18,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:18,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:18,688 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:18,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:18,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403364851] [2025-03-04 10:26:18,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403364851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:18,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745011718] [2025-03-04 10:26:18,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:18,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:18,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:18,694 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,696 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,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 10:26:18,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 10:26:18,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:18,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:18,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 10:26:18,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:18,878 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:18,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:18,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745011718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:18,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:18,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 13 [2025-03-04 10:26:18,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645070680] [2025-03-04 10:26:18,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:18,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:26:18,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:18,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:26:18,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:26:18,880 INFO L87 Difference]: Start difference. First operand 181 states and 214 transitions. Second operand has 10 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:19,015 INFO L93 Difference]: Finished difference Result 228 states and 267 transitions. [2025-03-04 10:26:19,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:26:19,016 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 67 [2025-03-04 10:26:19,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:19,017 INFO L225 Difference]: With dead ends: 228 [2025-03-04 10:26:19,017 INFO L226 Difference]: Without dead ends: 227 [2025-03-04 10:26:19,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:26:19,018 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 65 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:19,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 659 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-04 10:26:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 185. [2025-03-04 10:26:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 174 states have internal predecessors, (205), 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:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 218 transitions. [2025-03-04 10:26:19,031 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 218 transitions. Word has length 67 [2025-03-04 10:26:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:19,032 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 218 transitions. [2025-03-04 10:26:19,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 218 transitions. [2025-03-04 10:26:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 10:26:19,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:19,033 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:19,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:26:19,233 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,SelfDestructingSolverStorable23 [2025-03-04 10:26:19,234 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:19,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1889125359, now seen corresponding path program 1 times [2025-03-04 10:26:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:19,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023124210] [2025-03-04 10:26:19,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:19,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:19,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 10:26:19,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 10:26:19,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:19,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:19,459 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:19,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:19,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023124210] [2025-03-04 10:26:19,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023124210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:19,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:19,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:19,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085686491] [2025-03-04 10:26:19,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:19,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:19,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:19,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:19,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:19,461 INFO L87 Difference]: Start difference. First operand 185 states and 218 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:19,526 INFO L93 Difference]: Finished difference Result 193 states and 228 transitions. [2025-03-04 10:26:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:26:19,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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 68 [2025-03-04 10:26:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:19,528 INFO L225 Difference]: With dead ends: 193 [2025-03-04 10:26:19,528 INFO L226 Difference]: Without dead ends: 189 [2025-03-04 10:26:19,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:26:19,529 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 32 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:19,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 240 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-04 10:26:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-03-04 10:26:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 172 states have (on average 1.2267441860465116) internal successors, (211), 178 states have internal predecessors, (211), 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:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 224 transitions. [2025-03-04 10:26:19,546 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 224 transitions. Word has length 68 [2025-03-04 10:26:19,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:19,546 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 224 transitions. [2025-03-04 10:26:19,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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,547 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 224 transitions. [2025-03-04 10:26:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 10:26:19,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:19,548 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:19,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 10:26:19,548 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:19,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:19,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1566655935, now seen corresponding path program 1 times [2025-03-04 10:26:19,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:19,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211813197] [2025-03-04 10:26:19,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:19,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:19,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 10:26:19,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 10:26:19,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:19,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:19,599 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:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:19,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211813197] [2025-03-04 10:26:19,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211813197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:19,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:19,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:19,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124752080] [2025-03-04 10:26:19,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:19,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:19,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:19,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:19,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:19,601 INFO L87 Difference]: Start difference. First operand 189 states and 224 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:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:19,648 INFO L93 Difference]: Finished difference Result 189 states and 224 transitions. [2025-03-04 10:26:19,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:19,649 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:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:19,650 INFO L225 Difference]: With dead ends: 189 [2025-03-04 10:26:19,650 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 10:26:19,650 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:19,651 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 29 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:19,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 186 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 10:26:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-04 10:26:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 169 states have internal predecessors, (199), 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:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 212 transitions. [2025-03-04 10:26:19,664 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 212 transitions. Word has length 69 [2025-03-04 10:26:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:19,665 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 212 transitions. [2025-03-04 10:26:19,665 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:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 212 transitions. [2025-03-04 10:26:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 10:26:19,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:19,666 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:19,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 10:26:19,666 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:19,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:19,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1321693651, now seen corresponding path program 1 times [2025-03-04 10:26:19,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:19,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70261774] [2025-03-04 10:26:19,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:19,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:26:19,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:26:19,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:19,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:19,766 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:19,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:19,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70261774] [2025-03-04 10:26:19,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70261774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:19,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325376932] [2025-03-04 10:26:19,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:19,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:19,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:19,773 INFO L229 MonitoredProcess]: Starting monitored process 15 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:19,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:26:19,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:26:19,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:26:19,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:19,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:19,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 10:26:19,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:19,996 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:19,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:19,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325376932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:19,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:19,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 14 [2025-03-04 10:26:19,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20879903] [2025-03-04 10:26:19,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:19,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:26:19,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:19,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:26:19,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:26:19,998 INFO L87 Difference]: Start difference. First operand 180 states and 212 transitions. Second operand has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:20,175 INFO L93 Difference]: Finished difference Result 220 states and 256 transitions. [2025-03-04 10:26:20,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:26:20,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:20,177 INFO L225 Difference]: With dead ends: 220 [2025-03-04 10:26:20,177 INFO L226 Difference]: Without dead ends: 219 [2025-03-04 10:26:20,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:26:20,178 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 93 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:20,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 477 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-04 10:26:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 183. [2025-03-04 10:26:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 169 states have (on average 1.1952662721893492) internal successors, (202), 172 states have internal predecessors, (202), 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:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2025-03-04 10:26:20,191 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 70 [2025-03-04 10:26:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:20,192 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2025-03-04 10:26:20,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2025-03-04 10:26:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 10:26:20,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:20,193 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] [2025-03-04 10:26:20,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:26:20,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:20,397 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:20,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:20,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1642001318, now seen corresponding path program 1 times [2025-03-04 10:26:20,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:20,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792535742] [2025-03-04 10:26:20,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:20,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:20,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:26:20,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:26:20,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:20,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:20,498 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:20,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:20,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792535742] [2025-03-04 10:26:20,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792535742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:20,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486201542] [2025-03-04 10:26:20,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:20,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:20,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:20,500 INFO L229 MonitoredProcess]: Starting monitored process 16 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:20,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:26:20,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:26:20,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:26:20,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:20,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:20,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:26:20,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:20,636 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:20,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:20,749 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:20,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486201542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:20,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:20,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2025-03-04 10:26:20,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109027233] [2025-03-04 10:26:20,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:20,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:26:20,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:20,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:26:20,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:26:20,750 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 15 states have internal predecessors, (80), 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:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:21,017 INFO L93 Difference]: Finished difference Result 419 states and 489 transitions. [2025-03-04 10:26:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:26:21,017 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 15 states have internal predecessors, (80), 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 70 [2025-03-04 10:26:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:21,018 INFO L225 Difference]: With dead ends: 419 [2025-03-04 10:26:21,019 INFO L226 Difference]: Without dead ends: 281 [2025-03-04 10:26:21,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:26:21,020 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 83 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:21,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 660 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:26:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-04 10:26:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 189. [2025-03-04 10:26:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 175 states have (on average 1.1828571428571428) internal successors, (207), 177 states have internal predecessors, (207), 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:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 220 transitions. [2025-03-04 10:26:21,029 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 220 transitions. Word has length 70 [2025-03-04 10:26:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:21,030 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 220 transitions. [2025-03-04 10:26:21,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 15 states have internal predecessors, (80), 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:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 220 transitions. [2025-03-04 10:26:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 10:26:21,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:21,030 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] [2025-03-04 10:26:21,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:21,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:26:21,235 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:21,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1781982751, now seen corresponding path program 1 times [2025-03-04 10:26:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:21,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391051691] [2025-03-04 10:26:21,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:21,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:21,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 10:26:21,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 10:26:21,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:21,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:26:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391051691] [2025-03-04 10:26:21,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391051691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516281918] [2025-03-04 10:26:21,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:21,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:21,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:21,381 INFO L229 MonitoredProcess]: Starting monitored process 17 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:21,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:26:21,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 10:26:21,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 10:26:21,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:21,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:21,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 10:26:21,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 10:26:21,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 10:26:22,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516281918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:22,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:22,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 12] total 26 [2025-03-04 10:26:22,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573804881] [2025-03-04 10:26:22,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:22,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:26:22,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:22,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:26:22,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:26:22,022 INFO L87 Difference]: Start difference. First operand 189 states and 220 transitions. Second operand has 26 states, 24 states have (on average 3.625) internal successors, (87), 22 states have internal predecessors, (87), 4 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:26:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:22,991 INFO L93 Difference]: Finished difference Result 472 states and 552 transitions. [2025-03-04 10:26:22,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:26:22,991 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.625) internal successors, (87), 22 states have internal predecessors, (87), 4 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2025-03-04 10:26:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:22,993 INFO L225 Difference]: With dead ends: 472 [2025-03-04 10:26:22,993 INFO L226 Difference]: Without dead ends: 324 [2025-03-04 10:26:22,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=1398, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:26:22,994 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 93 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:22,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1892 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:26:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-04 10:26:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 197. [2025-03-04 10:26:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 181 states have (on average 1.171270718232044) internal successors, (212), 183 states have internal predecessors, (212), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 10:26:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 229 transitions. [2025-03-04 10:26:23,006 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 229 transitions. Word has length 75 [2025-03-04 10:26:23,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:23,007 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 229 transitions. [2025-03-04 10:26:23,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.625) internal successors, (87), 22 states have internal predecessors, (87), 4 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:26:23,011 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2025-03-04 10:26:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 10:26:23,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:23,011 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:23,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:26:23,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:26:23,212 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:23,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:23,213 INFO L85 PathProgramCache]: Analyzing trace with hash -284020155, now seen corresponding path program 1 times [2025-03-04 10:26:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:23,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716559762] [2025-03-04 10:26:23,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:23,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:23,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 10:26:23,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:26:23,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:23,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:26:23,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:23,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716559762] [2025-03-04 10:26:23,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716559762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:23,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816411752] [2025-03-04 10:26:23,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:23,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:23,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:23,406 INFO L229 MonitoredProcess]: Starting monitored process 18 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:23,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:26:23,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 10:26:23,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:26:23,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:23,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:23,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:26:23,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-04 10:26:23,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:23,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816411752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:23,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:23,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-04 10:26:23,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025953714] [2025-03-04 10:26:23,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:23,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:26:23,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:23,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:26:23,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:26:23,518 INFO L87 Difference]: Start difference. First operand 197 states and 229 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:23,605 INFO L93 Difference]: Finished difference Result 242 states and 279 transitions. [2025-03-04 10:26:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:26:23,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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 80 [2025-03-04 10:26:23,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:23,606 INFO L225 Difference]: With dead ends: 242 [2025-03-04 10:26:23,606 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 10:26:23,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:26:23,607 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 14 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 518 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:23,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 518 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:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 10:26:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 199. [2025-03-04 10:26:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 183 states have (on average 1.174863387978142) internal successors, (215), 184 states have internal predecessors, (215), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 10:26:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 232 transitions. [2025-03-04 10:26:23,617 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 232 transitions. Word has length 80 [2025-03-04 10:26:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:23,617 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 232 transitions. [2025-03-04 10:26:23,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 232 transitions. [2025-03-04 10:26:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 10:26:23,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:23,618 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2025-03-04 10:26:23,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:23,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:23,822 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:23,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:23,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2058687366, now seen corresponding path program 1 times [2025-03-04 10:26:23,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:23,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748564040] [2025-03-04 10:26:23,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:23,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:23,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 10:26:23,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:26:23,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:23,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:26:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:23,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748564040] [2025-03-04 10:26:23,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748564040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:23,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158547756] [2025-03-04 10:26:23,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:23,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:23,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:24,019 INFO L229 MonitoredProcess]: Starting monitored process 19 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:24,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:26:24,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 10:26:24,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:26:24,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:24,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:24,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:26:24,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-04 10:26:24,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:26:24,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158547756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:24,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:26:24,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-04 10:26:24,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335142760] [2025-03-04 10:26:24,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:24,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:26:24,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:24,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:26:24,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:26:24,152 INFO L87 Difference]: Start difference. First operand 199 states and 232 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 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:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:24,219 INFO L93 Difference]: Finished difference Result 233 states and 269 transitions. [2025-03-04 10:26:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:26:24,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 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 81 [2025-03-04 10:26:24,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:24,221 INFO L225 Difference]: With dead ends: 233 [2025-03-04 10:26:24,221 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 10:26:24,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:26:24,222 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:24,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 440 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 10:26:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2025-03-04 10:26:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 193 states have (on average 1.1709844559585492) internal successors, (226), 194 states have internal predecessors, (226), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 10:26:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2025-03-04 10:26:24,238 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 81 [2025-03-04 10:26:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:24,238 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2025-03-04 10:26:24,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 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:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2025-03-04 10:26:24,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 10:26:24,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:24,239 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:24,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:26:24,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:24,441 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:24,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:24,441 INFO L85 PathProgramCache]: Analyzing trace with hash 735133368, now seen corresponding path program 1 times [2025-03-04 10:26:24,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:24,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293103557] [2025-03-04 10:26:24,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:24,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:24,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 10:26:24,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:26:24,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:24,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 10:26:24,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:24,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293103557] [2025-03-04 10:26:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293103557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:24,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:24,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:26:24,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063509057] [2025-03-04 10:26:24,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:24,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:26:24,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:24,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:26:24,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:26:24,670 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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:24,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:24,713 INFO L93 Difference]: Finished difference Result 209 states and 243 transitions. [2025-03-04 10:26:24,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:24,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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:24,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:24,714 INFO L225 Difference]: With dead ends: 209 [2025-03-04 10:26:24,715 INFO L226 Difference]: Without dead ends: 208 [2025-03-04 10:26:24,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:26:24,717 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 45 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:24,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 182 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-04 10:26:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-03-04 10:26:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 193 states have (on average 1.16580310880829) internal successors, (225), 193 states have internal predecessors, (225), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 10:26:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 242 transitions. [2025-03-04 10:26:24,730 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 242 transitions. Word has length 82 [2025-03-04 10:26:24,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:24,731 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 242 transitions. [2025-03-04 10:26:24,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 242 transitions. [2025-03-04 10:26:24,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 10:26:24,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:24,732 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:24,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 10:26:24,732 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 10:26:24,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:24,733 INFO L85 PathProgramCache]: Analyzing trace with hash 320005144, now seen corresponding path program 1 times [2025-03-04 10:26:24,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:24,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983428009] [2025-03-04 10:26:24,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:24,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 10:26:24,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:26:24,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:24,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 10:26:25,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:25,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983428009] [2025-03-04 10:26:25,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983428009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:25,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:25,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:26:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270085725] [2025-03-04 10:26:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:25,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:26:25,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:25,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:26:25,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:26:25,023 INFO L87 Difference]: Start difference. First operand 208 states and 242 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:25,087 INFO L93 Difference]: Finished difference Result 208 states and 242 transitions. [2025-03-04 10:26:25,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:26:25,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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 85 [2025-03-04 10:26:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:25,088 INFO L225 Difference]: With dead ends: 208 [2025-03-04 10:26:25,088 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:26:25,089 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:25,089 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 24 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:25,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 279 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:26:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:26:25,090 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:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:26:25,090 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2025-03-04 10:26:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:25,090 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:26:25,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:26:25,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:26:25,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-04 10:26:25,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-04 10:26:25,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-04 10:26:25,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-04 10:26:25,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-04 10:26:25,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-04 10:26:25,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-04 10:26:25,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-04 10:26:25,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-04 10:26:25,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-04 10:26:25,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-04 10:26:25,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-04 10:26:25,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-04 10:26:25,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-04 10:26:25,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-04 10:26:25,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-04 10:26:25,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-04 10:26:25,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-04 10:26:25,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 10:26:25,096 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:26:40,126 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification. DAG size of input: 90 DAG size of output: 111 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-04 10:26:56,083 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:26:56,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:26:56 BoogieIcfgContainer [2025-03-04 10:26:56,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:26:56,098 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:26:56,098 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:26:56,098 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:26:56,102 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:10" (3/4) ... [2025-03-04 10:26:56,104 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:26:56,108 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure base2flt [2025-03-04 10:26:56,109 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:26:56,116 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 10:26:56,117 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 10:26:56,117 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:26:56,117 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:26:56,135 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:26:56,135 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) && (0 <= 0)) || (((e == \old(e)) && (m == \old(m))) && (16777216 <= m)))) && (e <= 127)) && (\old(m) != 1)) [2025-03-04 10:26:56,156 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) && (0 <= 0)) || (((e == \old(e)) && (m == \old(m))) && (16777216 <= m)))) && (e <= 127)) && (\old(m) != 1)) [2025-03-04 10:26:56,156 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:26:56,186 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:26:56,186 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:26:56,186 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:26:56,187 INFO L158 Benchmark]: Toolchain (without parser) took 46774.76ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 112.0MB in the beginning and 665.9MB in the end (delta: -554.0MB). Peak memory consumption was 414.1MB. Max. memory is 16.1GB. [2025-03-04 10:26:56,187 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:26:56,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.64ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 98.7MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:26:56,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.78ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:26:56,187 INFO L158 Benchmark]: Boogie Preprocessor took 28.80ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 95.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:26:56,187 INFO L158 Benchmark]: IcfgBuilder took 458.97ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 70.3MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:26:56,187 INFO L158 Benchmark]: TraceAbstraction took 45966.67ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 69.4MB in the beginning and 263.5MB in the end (delta: -194.1MB). Peak memory consumption was 373.1MB. Max. memory is 16.1GB. [2025-03-04 10:26:56,188 INFO L158 Benchmark]: Witness Printer took 88.38ms. Allocated memory is still 704.6MB. Free memory was 263.5MB in the beginning and 665.9MB in the end (delta: -402.5MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2025-03-04 10:26:56,188 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.32ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.64ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 98.7MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.78ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.80ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 95.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 458.97ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 70.3MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 45966.67ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 69.4MB in the beginning and 263.5MB in the end (delta: -194.1MB). Peak memory consumption was 373.1MB. Max. memory is 16.1GB. * Witness Printer took 88.38ms. Allocated memory is still 704.6MB. Free memory was 263.5MB in the beginning and 665.9MB in the end (delta: -402.5MB). Peak memory consumption was 8.6MB. 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, 110 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 33, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1852 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1833 mSDsluCounter, 12935 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10246 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4192 IncrementalHoareTripleChecker+Invalid, 4306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 2689 mSDtfsCounter, 4192 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1557 GetRequests, 1284 SyntacticMatches, 2 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=31, InterpolantAutomatonStates: 241, 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, 33 MinimizatonAttempts, 1169 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2598 NumberOfCodeBlocks, 2598 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2855 ConstructedInterpolants, 0 QuantifiedInterpolants, 6092 SizeOfPredicates, 27 NumberOfNonLiveVariables, 2874 ConjunctsInSsa, 275 ConjunctsInUnsatCore, 56 InterpolantComputations, 28 PerfectInterpolantSequences, 1431/1723 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) && (0 <= 0)) || (((e == \old(e)) && (m == \old(m))) && (16777216 <= m)))) && (e <= 127)) && (\old(m) != 1)) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:26:56,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE