./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-fpi/condnf.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/array-fpi/condnf.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 f71f01dc38efbcea276a0ff799d485cde0ac6c564de665d7efc24977838eb82a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:40:19,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:40:19,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:40:19,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:40:19,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:40:19,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:40:19,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:40:19,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:40:19,768 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:40:19,768 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:40:19,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:40:19,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:40:19,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:40:19,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:40:19,769 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:40:19,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:40:19,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:40:19,769 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:40:19,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:40:19,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:40:19,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:40:19,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:40:19,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:40:19,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:40:19,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:40:19,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:40:19,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:40:19,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:40:19,771 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 -> f71f01dc38efbcea276a0ff799d485cde0ac6c564de665d7efc24977838eb82a [2025-03-17 14:40:20,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:40:20,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:40:20,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:40:20,030 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:40:20,030 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:40:20,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condnf.c [2025-03-17 14:40:21,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65dc8f22d/f89a96a276f640aebc4a0b7d052afac0/FLAG77b390a8c [2025-03-17 14:40:21,389 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:40:21,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condnf.c [2025-03-17 14:40:21,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65dc8f22d/f89a96a276f640aebc4a0b7d052afac0/FLAG77b390a8c [2025-03-17 14:40:21,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65dc8f22d/f89a96a276f640aebc4a0b7d052afac0 [2025-03-17 14:40:21,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:40:21,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:40:21,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:40:21,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:40:21,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:40:21,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bc32e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21, skipping insertion in model container [2025-03-17 14:40:21,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:40:21,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:40:21,847 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:40:21,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:40:21,865 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:40:21,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21 WrapperNode [2025-03-17 14:40:21,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:40:21,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:40:21,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:40:21,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:40:21,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,889 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 69 [2025-03-17 14:40:21,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:40:21,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:40:21,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:40:21,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:40:21,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,915 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-17 14:40:21,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,924 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:40:21,927 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:40:21,927 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:40:21,927 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:40:21,930 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21" (1/1) ... [2025-03-17 14:40:21,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:40:21,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:21,960 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-17 14:40:21,966 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-17 14:40:21,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:40:21,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:40:21,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:40:21,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:40:21,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:40:21,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:40:21,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:40:21,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:40:21,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:40:21,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:40:22,037 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:40:22,038 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:40:22,171 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-17 14:40:22,171 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:40:22,177 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:40:22,178 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:40:22,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:40:22 BoogieIcfgContainer [2025-03-17 14:40:22,178 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:40:22,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:40:22,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:40:22,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:40:22,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:40:21" (1/3) ... [2025-03-17 14:40:22,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29087624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:40:22, skipping insertion in model container [2025-03-17 14:40:22,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:40:21" (2/3) ... [2025-03-17 14:40:22,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29087624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:40:22, skipping insertion in model container [2025-03-17 14:40:22,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:40:22" (3/3) ... [2025-03-17 14:40:22,185 INFO L128 eAbstractionObserver]: Analyzing ICFG condnf.c [2025-03-17 14:40:22,195 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:40:22,197 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG condnf.c that has 1 procedures, 26 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-17 14:40:22,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:40:22,243 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;@74271a0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:40:22,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 14:40:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 25 states have internal predecessors, (32), 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-17 14:40:22,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:40:22,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:22,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:40:22,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:22,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1892201150, now seen corresponding path program 1 times [2025-03-17 14:40:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:22,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014219191] [2025-03-17 14:40:22,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:22,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:22,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:40:22,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:40:22,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:22,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:22,348 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-17 14:40:22,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:22,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014219191] [2025-03-17 14:40:22,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014219191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:40:22,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:40:22,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:40:22,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137945204] [2025-03-17 14:40:22,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:40:22,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:40:22,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:22,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:40:22,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:40:22,367 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 25 states have internal predecessors, (32), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 14:40:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:22,374 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-03-17 14:40:22,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:40:22,375 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2025-03-17 14:40:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:22,379 INFO L225 Difference]: With dead ends: 49 [2025-03-17 14:40:22,379 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 14:40:22,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:40:22,382 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:22,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:40:22,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 14:40:22,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-17 14:40:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 22 states have internal predecessors, (26), 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-17 14:40:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-17 14:40:22,404 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2025-03-17 14:40:22,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:22,404 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-17 14:40:22,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 14:40:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-17 14:40:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:40:22,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:22,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:40:22,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:40:22,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:22,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:22,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1892230941, now seen corresponding path program 1 times [2025-03-17 14:40:22,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:22,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983888841] [2025-03-17 14:40:22,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:22,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:22,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:40:22,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:40:22,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:22,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:22,520 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-17 14:40:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983888841] [2025-03-17 14:40:22,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983888841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:40:22,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:40:22,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:40:22,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580451580] [2025-03-17 14:40:22,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:40:22,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:40:22,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:22,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:40:22,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:40:22,522 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-17 14:40:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:22,582 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-03-17 14:40:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:40:22,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) Word has length 6 [2025-03-17 14:40:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:22,584 INFO L225 Difference]: With dead ends: 34 [2025-03-17 14:40:22,584 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 14:40:22,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:40:22,585 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:22,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:40:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 14:40:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2025-03-17 14:40:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 25 states have internal predecessors, (30), 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-17 14:40:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-03-17 14:40:22,591 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 6 [2025-03-17 14:40:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:22,591 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-17 14:40:22,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-17 14:40:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-03-17 14:40:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 14:40:22,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:22,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:22,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:40:22,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:22,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1453619, now seen corresponding path program 1 times [2025-03-17 14:40:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:22,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249808135] [2025-03-17 14:40:22,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:22,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:40:22,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:40:22,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:22,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:22,682 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-17 14:40:22,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:22,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249808135] [2025-03-17 14:40:22,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249808135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:40:22,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:40:22,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:40:22,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229936814] [2025-03-17 14:40:22,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:40:22,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:40:22,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:22,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:40:22,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:40:22,684 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-17 14:40:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:22,728 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-03-17 14:40:22,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:40:22,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2025-03-17 14:40:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:22,731 INFO L225 Difference]: With dead ends: 46 [2025-03-17 14:40:22,731 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 14:40:22,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-17 14:40:22,732 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:22,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 27 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:40:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 14:40:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2025-03-17 14:40:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 26 states have internal predecessors, (30), 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-17 14:40:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-03-17 14:40:22,737 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 9 [2025-03-17 14:40:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:22,737 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-03-17 14:40:22,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-17 14:40:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-03-17 14:40:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 14:40:22,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:22,737 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:22,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:40:22,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:22,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:22,738 INFO L85 PathProgramCache]: Analyzing trace with hash 6194520, now seen corresponding path program 1 times [2025-03-17 14:40:22,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:22,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594624182] [2025-03-17 14:40:22,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:22,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:40:22,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:40:22,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:22,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:22,847 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-17 14:40:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594624182] [2025-03-17 14:40:22,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594624182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643911531] [2025-03-17 14:40:22,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:22,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:22,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:22,851 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-17 14:40:22,852 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-17 14:40:22,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:40:22,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:40:22,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:22,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:22,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:40:22,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:22,958 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-17 14:40:22,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:40:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643911531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:40:22,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:40:22,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 14:40:22,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015201933] [2025-03-17 14:40:22,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:40:22,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:40:22,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:22,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:40:22,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:40:22,959 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-17 14:40:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:23,012 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-03-17 14:40:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:40:23,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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) Word has length 9 [2025-03-17 14:40:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:23,013 INFO L225 Difference]: With dead ends: 32 [2025-03-17 14:40:23,014 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 14:40:23,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:40:23,014 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:23,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 58 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:40:23,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 14:40:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2025-03-17 14:40:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 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-17 14:40:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-17 14:40:23,019 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2025-03-17 14:40:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:23,019 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-17 14:40:23,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-17 14:40:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-17 14:40:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 14:40:23,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:23,020 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:23,026 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-17 14:40:23,220 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-17 14:40:23,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:23,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:23,221 INFO L85 PathProgramCache]: Analyzing trace with hash 192030111, now seen corresponding path program 1 times [2025-03-17 14:40:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:23,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346173739] [2025-03-17 14:40:23,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:23,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:23,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:40:23,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:40:23,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:23,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:40:23,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346173739] [2025-03-17 14:40:23,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346173739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234479949] [2025-03-17 14:40:23,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:23,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:23,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:23,308 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-17 14:40:23,310 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-17 14:40:23,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:40:23,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:40:23,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:23,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:23,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:40:23,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:40:23,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:40:23,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234479949] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:23,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:23,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:40:23,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680990690] [2025-03-17 14:40:23,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:23,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:40:23,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:23,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:40:23,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:40:23,420 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 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-17 14:40:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:23,480 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2025-03-17 14:40:23,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:40:23,480 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 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) Word has length 10 [2025-03-17 14:40:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:23,482 INFO L225 Difference]: With dead ends: 41 [2025-03-17 14:40:23,482 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 14:40:23,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:40:23,482 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:23,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 48 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:40:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 14:40:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2025-03-17 14:40:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 34 states have internal predecessors, (41), 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-17 14:40:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-03-17 14:40:23,486 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 10 [2025-03-17 14:40:23,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:23,486 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-03-17 14:40:23,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 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-17 14:40:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-03-17 14:40:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:40:23,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:23,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:23,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:40:23,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:23,689 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:23,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash -147398120, now seen corresponding path program 1 times [2025-03-17 14:40:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:23,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713617656] [2025-03-17 14:40:23,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:23,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:23,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:40:23,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:40:23,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:23,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:40:23,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:23,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713617656] [2025-03-17 14:40:23,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713617656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:40:23,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:40:23,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:40:23,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710297032] [2025-03-17 14:40:23,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:40:23,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:40:23,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:23,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:40:23,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:40:23,737 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-17 14:40:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:23,771 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-03-17 14:40:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:40:23,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2025-03-17 14:40:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:23,772 INFO L225 Difference]: With dead ends: 44 [2025-03-17 14:40:23,772 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 14:40:23,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:40:23,772 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:23,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:40:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 14:40:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2025-03-17 14:40:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 38 states have internal predecessors, (46), 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-17 14:40:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2025-03-17 14:40:23,778 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 12 [2025-03-17 14:40:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:23,778 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-03-17 14:40:23,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-17 14:40:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2025-03-17 14:40:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 14:40:23,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:23,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:23,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:40:23,780 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:23,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash -373828814, now seen corresponding path program 1 times [2025-03-17 14:40:23,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:23,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235853948] [2025-03-17 14:40:23,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:23,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:23,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:40:23,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:40:23,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:23,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:40:23,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:23,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235853948] [2025-03-17 14:40:23,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235853948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:23,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928790105] [2025-03-17 14:40:23,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:23,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:23,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:23,857 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-17 14:40:23,859 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-17 14:40:23,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:40:23,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:40:23,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:23,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:23,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:40:23,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:40:23,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:40:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928790105] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:24,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:24,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-03-17 14:40:24,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315443220] [2025-03-17 14:40:24,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:24,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 14:40:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:24,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 14:40:24,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:40:24,087 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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-17 14:40:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:24,255 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2025-03-17 14:40:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:40:24,256 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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) Word has length 17 [2025-03-17 14:40:24,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:24,256 INFO L225 Difference]: With dead ends: 67 [2025-03-17 14:40:24,256 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 14:40:24,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:40:24,258 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:24,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 83 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:40:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 14:40:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2025-03-17 14:40:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.3) internal successors, (52), 43 states have internal predecessors, (52), 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-17 14:40:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-03-17 14:40:24,263 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 17 [2025-03-17 14:40:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:24,263 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-03-17 14:40:24,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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-17 14:40:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-03-17 14:40:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 14:40:24,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:24,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:24,270 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-17 14:40:24,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:24,465 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:24,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:24,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1288604980, now seen corresponding path program 1 times [2025-03-17 14:40:24,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:24,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869079665] [2025-03-17 14:40:24,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:24,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:24,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:40:24,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:40:24,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:24,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:40:24,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:24,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869079665] [2025-03-17 14:40:24,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869079665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:40:24,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:40:24,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:40:24,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763280797] [2025-03-17 14:40:24,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:40:24,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:40:24,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:24,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:40:24,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:40:24,513 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-17 14:40:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:24,543 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2025-03-17 14:40:24,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:40:24,543 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), 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) Word has length 18 [2025-03-17 14:40:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:24,543 INFO L225 Difference]: With dead ends: 51 [2025-03-17 14:40:24,543 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 14:40:24,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:40:24,544 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:24,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 36 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:40:24,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 14:40:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 14:40:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 48 states have internal predecessors, (57), 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-17 14:40:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-03-17 14:40:24,552 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 18 [2025-03-17 14:40:24,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:24,552 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-17 14:40:24,552 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), 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-17 14:40:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-03-17 14:40:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 14:40:24,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:24,553 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2025-03-17 14:40:24,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:40:24,553 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:24,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:24,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1782528058, now seen corresponding path program 2 times [2025-03-17 14:40:24,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:24,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801836741] [2025-03-17 14:40:24,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:40:24,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:24,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-17 14:40:24,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-17 14:40:24,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:40:24,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:40:24,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:24,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801836741] [2025-03-17 14:40:24,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801836741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:24,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301411738] [2025-03-17 14:40:24,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:40:24,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:24,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:24,600 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-17 14:40:24,601 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-17 14:40:24,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-17 14:40:24,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-17 14:40:24,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:40:24,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:24,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:40:24,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:40:24,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:40:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301411738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:24,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:24,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-17 14:40:24,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227909541] [2025-03-17 14:40:24,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:24,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:40:24,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:24,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:40:24,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:40:24,711 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-17 14:40:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:24,733 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-03-17 14:40:24,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:40:24,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 19 [2025-03-17 14:40:24,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:24,734 INFO L225 Difference]: With dead ends: 49 [2025-03-17 14:40:24,734 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 14:40:24,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:40:24,735 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:24,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 23 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:40:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 14:40:24,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2025-03-17 14:40:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 states have internal predecessors, (46), 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-17 14:40:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-03-17 14:40:24,740 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 19 [2025-03-17 14:40:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:24,740 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-17 14:40:24,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-17 14:40:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-03-17 14:40:24,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 14:40:24,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:24,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:24,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:40:24,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:24,941 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:24,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:24,941 INFO L85 PathProgramCache]: Analyzing trace with hash 971862199, now seen corresponding path program 1 times [2025-03-17 14:40:24,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:24,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086874717] [2025-03-17 14:40:24,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:24,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:24,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:40:24,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:40:24,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:24,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:40:25,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:25,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086874717] [2025-03-17 14:40:25,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086874717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:25,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154392373] [2025-03-17 14:40:25,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:25,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:25,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:25,004 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-17 14:40:25,005 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-17 14:40:25,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:40:25,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:40:25,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:25,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:25,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:40:25,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:40:25,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:40:25,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154392373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:25,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:25,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:40:25,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164271149] [2025-03-17 14:40:25,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:25,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:40:25,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:25,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:40:25,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:40:25,112 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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-17 14:40:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:25,172 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2025-03-17 14:40:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:40:25,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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) Word has length 21 [2025-03-17 14:40:25,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:25,173 INFO L225 Difference]: With dead ends: 56 [2025-03-17 14:40:25,173 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 14:40:25,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:40:25,174 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:25,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 51 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:40:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 14:40:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-17 14:40:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 54 states have internal predecessors, (67), 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-17 14:40:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2025-03-17 14:40:25,178 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 21 [2025-03-17 14:40:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:25,178 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2025-03-17 14:40:25,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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-17 14:40:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2025-03-17 14:40:25,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 14:40:25,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:25,179 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:25,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:40:25,379 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,SelfDestructingSolverStorable9 [2025-03-17 14:40:25,379 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:25,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:25,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1987555214, now seen corresponding path program 1 times [2025-03-17 14:40:25,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:25,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178204250] [2025-03-17 14:40:25,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:25,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:25,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:40:25,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:40:25,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:25,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:40:25,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:25,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178204250] [2025-03-17 14:40:25,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178204250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:25,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412189415] [2025-03-17 14:40:25,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:25,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:25,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:25,436 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-17 14:40:25,438 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-17 14:40:25,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:40:25,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:40:25,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:25,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:25,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:40:25,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:40:25,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:40:25,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412189415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:25,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:25,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2025-03-17 14:40:25,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980957649] [2025-03-17 14:40:25,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:25,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:40:25,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:25,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:40:25,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:40:25,645 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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-17 14:40:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:25,797 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2025-03-17 14:40:25,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:40:25,797 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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) Word has length 23 [2025-03-17 14:40:25,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:25,798 INFO L225 Difference]: With dead ends: 70 [2025-03-17 14:40:25,799 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 14:40:25,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:40:25,799 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:25,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 81 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:40:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 14:40:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-03-17 14:40:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 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-17 14:40:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-03-17 14:40:25,805 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 23 [2025-03-17 14:40:25,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:25,806 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-03-17 14:40:25,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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-17 14:40:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-03-17 14:40:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 14:40:25,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:25,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:25,812 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-17 14:40:26,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:26,011 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:26,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash 50112402, now seen corresponding path program 1 times [2025-03-17 14:40:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:26,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079090840] [2025-03-17 14:40:26,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:26,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:40:26,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:40:26,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:26,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:40:26,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:26,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079090840] [2025-03-17 14:40:26,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079090840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:26,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173615686] [2025-03-17 14:40:26,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:26,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:26,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:26,070 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-17 14:40:26,071 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-17 14:40:26,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:40:26,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:40:26,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:26,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:26,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:40:26,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:40:26,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:40:26,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173615686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:26,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:26,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2025-03-17 14:40:26,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528960180] [2025-03-17 14:40:26,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:26,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:40:26,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:26,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:40:26,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:40:26,270 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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-17 14:40:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:26,418 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-03-17 14:40:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 14:40:26,418 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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) Word has length 27 [2025-03-17 14:40:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:26,419 INFO L225 Difference]: With dead ends: 64 [2025-03-17 14:40:26,420 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 14:40:26,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-03-17 14:40:26,421 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:26,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 53 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:40:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 14:40:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-17 14:40:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 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-17 14:40:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2025-03-17 14:40:26,427 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 27 [2025-03-17 14:40:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:26,427 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-03-17 14:40:26,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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-17 14:40:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2025-03-17 14:40:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 14:40:26,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:26,429 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:26,434 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-17 14:40:26,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:26,630 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:26,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:26,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1458432709, now seen corresponding path program 2 times [2025-03-17 14:40:26,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:26,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595033508] [2025-03-17 14:40:26,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:40:26,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:26,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 14:40:26,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 36 statements. [2025-03-17 14:40:26,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:40:26,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-17 14:40:26,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:26,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595033508] [2025-03-17 14:40:26,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595033508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:26,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125349804] [2025-03-17 14:40:26,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:40:26,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:26,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:26,664 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-17 14:40:26,665 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-17 14:40:26,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 14:40:26,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 36 statements. [2025-03-17 14:40:26,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:40:26,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:26,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:40:26,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-17 14:40:26,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-17 14:40:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125349804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:26,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:26,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-17 14:40:26,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461244733] [2025-03-17 14:40:26,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:26,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:40:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:26,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:40:26,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:40:26,774 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-17 14:40:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:26,803 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2025-03-17 14:40:26,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:40:26,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 36 [2025-03-17 14:40:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:26,804 INFO L225 Difference]: With dead ends: 53 [2025-03-17 14:40:26,804 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 14:40:26,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:40:26,804 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:26,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:40:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 14:40:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2025-03-17 14:40:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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-17 14:40:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-03-17 14:40:26,807 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 36 [2025-03-17 14:40:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:26,807 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-03-17 14:40:26,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-17 14:40:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-03-17 14:40:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 14:40:26,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:26,808 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:26,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:40:27,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 14:40:27,012 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:40:27,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:27,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1613961518, now seen corresponding path program 2 times [2025-03-17 14:40:27,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:27,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062856297] [2025-03-17 14:40:27,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:40:27,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:27,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-17 14:40:27,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 37 statements. [2025-03-17 14:40:27,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:40:27,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 14:40:27,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:27,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062856297] [2025-03-17 14:40:27,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062856297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:27,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883442484] [2025-03-17 14:40:27,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:40:27,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:27,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:27,048 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-17 14:40:27,049 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-17 14:40:27,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-17 14:40:27,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 37 statements. [2025-03-17 14:40:27,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:40:27,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:27,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:40:27,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 14:40:27,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 14:40:27,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883442484] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:27,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:27,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-17 14:40:27,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736215955] [2025-03-17 14:40:27,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:27,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:40:27,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:27,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:40:27,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:40:27,158 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-17 14:40:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:27,186 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-03-17 14:40:27,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:40:27,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) Word has length 37 [2025-03-17 14:40:27,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:27,187 INFO L225 Difference]: With dead ends: 38 [2025-03-17 14:40:27,187 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:40:27,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:40:27,187 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:27,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 16 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:40:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:40:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:40:27,188 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-17 14:40:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:40:27,188 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2025-03-17 14:40:27,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:27,188 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:40:27,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-17 14:40:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:40:27,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:40:27,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 14:40:27,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 14:40:27,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 14:40:27,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 14:40:27,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 14:40:27,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 14:40:27,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:40:27,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 14:40:27,393 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:27,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:40:27,545 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:40:27,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:40:27 BoogieIcfgContainer [2025-03-17 14:40:27,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:40:27,559 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:40:27,559 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:40:27,559 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:40:27,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:40:22" (3/4) ... [2025-03-17 14:40:27,561 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:40:27,568 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 14:40:27,569 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:40:27,569 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:40:27,569 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:40:27,631 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:40:27,631 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:40:27,631 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:40:27,632 INFO L158 Benchmark]: Toolchain (without parser) took 5906.01ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 81.4MB in the end (delta: 30.7MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2025-03-17 14:40:27,632 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:40:27,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.48ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 101.0MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:40:27,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.29ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:40:27,633 INFO L158 Benchmark]: Boogie Preprocessor took 35.35ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.6MB in the end (delta: 988.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:40:27,633 INFO L158 Benchmark]: IcfgBuilder took 251.44ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 85.3MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:40:27,634 INFO L158 Benchmark]: TraceAbstraction took 5378.07ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 87.1MB in the end (delta: -2.3MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2025-03-17 14:40:27,634 INFO L158 Benchmark]: Witness Printer took 72.52ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 81.4MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:40:27,635 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.14ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.48ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 101.0MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.29ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.35ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.6MB in the end (delta: 988.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 251.44ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 85.3MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5378.07ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 87.1MB in the end (delta: -2.3MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * Witness Printer took 72.52ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 81.4MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: 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 1 procedures, 26 locations, 32 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 602 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 414 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1099 IncrementalHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 188 mSDtfsCounter, 1099 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 329 SyntacticMatches, 16 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=10, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 58 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 449 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 608 ConstructedInterpolants, 0 QuantifiedInterpolants, 1602 SizeOfPredicates, 13 NumberOfNonLiveVariables, 704 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 31 InterpolantComputations, 6 PerfectInterpolantSequences, 299/448 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 6 specifications checked. All of them hold - InvariantResult [Line: 30]: Location Invariant Derived location invariant: (((((i == 0) && (N <= 2147483647)) && (1 <= N)) || (((1 <= i) && (N <= 2147483647)) && (2 <= N))) || (((N <= 2147483647) && (i == 1)) && (1 <= N))) - InvariantResult [Line: 44]: Location Invariant Derived location invariant: ((((((1 <= i) && (N <= 2147483647)) && (2 <= N)) || (((i == 0) && (N <= 2147483647)) && (2 <= N))) || ((N == 1) && (i == 1))) || ((i == 0) && (N == 1))) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: ((((((1 <= i) && (N <= 2147483647)) && (2 <= N)) || (((i == 0) && (N <= 2147483647)) && (2 <= N))) || ((N == 1) && (i == 1))) || ((i == 0) && (N == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:40:27,647 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