./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_22_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_22_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 4d62e89f3acdc36b1249a0f63b3eda241e4dec1a6cfb9fc24493da0cfc99de71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 16:36:05,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 16:36:05,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 16:36:05,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 16:36:05,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 16:36:05,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 16:36:05,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 16:36:05,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 16:36:05,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 16:36:05,921 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 16:36:05,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 16:36:05,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 16:36:05,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 16:36:05,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 16:36:05,922 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 16:36:05,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 16:36:05,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 16:36:05,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 16:36:05,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 16:36:05,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 16:36:05,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 16:36:05,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 16:36:05,922 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 16:36:05,922 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 16:36:05,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 16:36:05,923 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 16:36:05,923 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 16:36:05,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 16:36:05,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 16:36:05,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 16:36:05,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 16:36:05,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 16:36:05,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 16:36:05,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 16:36:05,924 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 16:36:05,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 16:36:05,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 16:36:05,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 16:36:05,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 16:36:05,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 16:36:05,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 16:36:05,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 16:36:05,925 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d62e89f3acdc36b1249a0f63b3eda241e4dec1a6cfb9fc24493da0cfc99de71 [2025-02-06 16:36:06,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 16:36:06,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 16:36:06,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 16:36:06,192 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 16:36:06,192 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 16:36:06,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_22_good.i [2025-02-06 16:36:07,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0665c09c2/9cf25db7d3a047d7adbe6e234a2383c2/FLAGfe7b9b501 [2025-02-06 16:36:07,987 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 16:36:07,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_22_good.i [2025-02-06 16:36:08,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0665c09c2/9cf25db7d3a047d7adbe6e234a2383c2/FLAGfe7b9b501 [2025-02-06 16:36:08,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0665c09c2/9cf25db7d3a047d7adbe6e234a2383c2 [2025-02-06 16:36:08,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 16:36:08,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 16:36:08,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 16:36:08,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 16:36:08,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 16:36:08,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691d3a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08, skipping insertion in model container [2025-02-06 16:36:08,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 16:36:08,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 16:36:08,667 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 16:36:08,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 16:36:08,829 INFO L204 MainTranslator]: Completed translation [2025-02-06 16:36:08,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08 WrapperNode [2025-02-06 16:36:08,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 16:36:08,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 16:36:08,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 16:36:08,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 16:36:08,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,877 INFO L138 Inliner]: procedures = 503, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 76 [2025-02-06 16:36:08,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 16:36:08,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 16:36:08,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 16:36:08,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 16:36:08,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,893 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 16:36:08,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 16:36:08,900 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 16:36:08,900 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 16:36:08,900 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 16:36:08,901 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08" (1/1) ... [2025-02-06 16:36:08,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 16:36:08,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 16:36:08,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 16:36:08,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 16:36:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-06 16:36:08,971 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-06 16:36:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-06 16:36:08,971 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-06 16:36:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 16:36:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 16:36:08,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 16:36:09,088 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 16:36:09,090 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 16:36:09,259 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-06 16:36:09,259 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 16:36:09,272 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 16:36:09,272 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 16:36:09,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:36:09 BoogieIcfgContainer [2025-02-06 16:36:09,274 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 16:36:09,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 16:36:09,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 16:36:09,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 16:36:09,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:36:08" (1/3) ... [2025-02-06 16:36:09,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61df0e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:36:09, skipping insertion in model container [2025-02-06 16:36:09,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:08" (2/3) ... [2025-02-06 16:36:09,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61df0e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:36:09, skipping insertion in model container [2025-02-06 16:36:09,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:36:09" (3/3) ... [2025-02-06 16:36:09,287 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_22_good.i [2025-02-06 16:36:09,305 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 16:36:09,309 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_max_multiply_22_good.i that has 3 procedures, 52 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-02-06 16:36:09,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 16:36:09,384 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;@4b197933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 16:36:09,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 16:36:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 44 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 16:36:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 16:36:09,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:09,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:09,397 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-02-06 16:36:09,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:09,402 INFO L85 PathProgramCache]: Analyzing trace with hash 681390339, now seen corresponding path program 1 times [2025-02-06 16:36:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:09,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647024313] [2025-02-06 16:36:09,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:09,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:09,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 16:36:09,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 16:36:09,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:09,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:09,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 16:36:09,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:09,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647024313] [2025-02-06 16:36:09,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647024313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:09,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:09,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 16:36:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875946805] [2025-02-06 16:36:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:09,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:09,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:09,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:09,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:09,703 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 44 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:36:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:09,751 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2025-02-06 16:36:09,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:09,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-06 16:36:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:09,760 INFO L225 Difference]: With dead ends: 90 [2025-02-06 16:36:09,760 INFO L226 Difference]: Without dead ends: 42 [2025-02-06 16:36:09,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:09,767 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:09,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 112 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-06 16:36:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-02-06 16:36:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 35 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 16:36:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-02-06 16:36:09,809 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 12 [2025-02-06 16:36:09,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:09,811 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-02-06 16:36:09,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:36:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-02-06 16:36:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 16:36:09,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:09,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:09,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 16:36:09,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 16:36:09,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash -351735958, now seen corresponding path program 1 times [2025-02-06 16:36:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:09,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232391946] [2025-02-06 16:36:09,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:09,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 16:36:09,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 16:36:09,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:09,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 16:36:09,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:09,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232391946] [2025-02-06 16:36:09,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232391946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:09,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:09,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:09,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650161563] [2025-02-06 16:36:09,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:09,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:09,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:09,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:09,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:09,935 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:36:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:09,947 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2025-02-06 16:36:09,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:09,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-06 16:36:09,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:09,948 INFO L225 Difference]: With dead ends: 69 [2025-02-06 16:36:09,949 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 16:36:09,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:09,950 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:09,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 78 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:09,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 16:36:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-02-06 16:36:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 16:36:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-02-06 16:36:09,955 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 13 [2025-02-06 16:36:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:09,955 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-02-06 16:36:09,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:36:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-02-06 16:36:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 16:36:09,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:09,956 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:09,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 16:36:09,956 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-02-06 16:36:09,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:09,957 INFO L85 PathProgramCache]: Analyzing trace with hash -316009487, now seen corresponding path program 1 times [2025-02-06 16:36:09,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:09,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898069046] [2025-02-06 16:36:09,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:09,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:09,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 16:36:09,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 16:36:09,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:09,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 16:36:10,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:10,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898069046] [2025-02-06 16:36:10,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898069046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:10,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:10,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275348411] [2025-02-06 16:36:10,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:10,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:10,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:10,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:10,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:10,027 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 16:36:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:10,037 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2025-02-06 16:36:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:10,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-02-06 16:36:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:10,041 INFO L225 Difference]: With dead ends: 63 [2025-02-06 16:36:10,041 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 16:36:10,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:10,042 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:10,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 16:36:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 16:36:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 16:36:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-02-06 16:36:10,048 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 20 [2025-02-06 16:36:10,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:10,048 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-02-06 16:36:10,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 16:36:10,048 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-02-06 16:36:10,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 16:36:10,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:10,049 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:10,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 16:36:10,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 16:36:10,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:10,050 INFO L85 PathProgramCache]: Analyzing trace with hash 620074233, now seen corresponding path program 1 times [2025-02-06 16:36:10,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:10,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636716773] [2025-02-06 16:36:10,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:10,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:10,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 16:36:10,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 16:36:10,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:10,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 16:36:10,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:10,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636716773] [2025-02-06 16:36:10,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636716773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:10,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:10,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 16:36:10,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457935689] [2025-02-06 16:36:10,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:10,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:10,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:10,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:10,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:10,123 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 16:36:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:10,147 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2025-02-06 16:36:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:10,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-02-06 16:36:10,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:10,149 INFO L225 Difference]: With dead ends: 44 [2025-02-06 16:36:10,149 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 16:36:10,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:10,150 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:10,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 60 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:10,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 16:36:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2025-02-06 16:36:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 16:36:10,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-02-06 16:36:10,161 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 22 [2025-02-06 16:36:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:10,161 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-02-06 16:36:10,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 16:36:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-02-06 16:36:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 16:36:10,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:10,162 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-02-06 16:36:10,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 16:36:10,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 16:36:10,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:10,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2042432036, now seen corresponding path program 1 times [2025-02-06 16:36:10,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:10,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994258122] [2025-02-06 16:36:10,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:10,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:10,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 16:36:10,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 16:36:10,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:10,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 16:36:10,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:10,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994258122] [2025-02-06 16:36:10,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994258122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:10,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:10,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 16:36:10,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13977501] [2025-02-06 16:36:10,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:10,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 16:36:10,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:10,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 16:36:10,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 16:36:10,332 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 16:36:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:10,343 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2025-02-06 16:36:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 16:36:10,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-06 16:36:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:10,344 INFO L225 Difference]: With dead ends: 43 [2025-02-06 16:36:10,344 INFO L226 Difference]: Without dead ends: 27 [2025-02-06 16:36:10,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-02-06 16:36:10,345 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:10,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-06 16:36:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-02-06 16:36:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 16:36:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-02-06 16:36:10,348 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2025-02-06 16:36:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:10,348 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-02-06 16:36:10,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 16:36:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-02-06 16:36:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 16:36:10,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:10,349 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, 1] [2025-02-06 16:36:10,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 16:36:10,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 16:36:10,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:10,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1089998451, now seen corresponding path program 1 times [2025-02-06 16:36:10,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:10,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946849537] [2025-02-06 16:36:10,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:10,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:10,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 16:36:10,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 16:36:10,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:10,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 16:36:10,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946849537] [2025-02-06 16:36:10,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946849537] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 16:36:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509062813] [2025-02-06 16:36:10,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:10,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 16:36:10,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 16:36:10,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 16:36:10,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 16:36:10,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 16:36:10,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 16:36:10,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:10,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:10,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 16:36:10,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 16:36:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 16:36:10,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 16:36:10,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509062813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:10,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 16:36:10,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-06 16:36:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24657973] [2025-02-06 16:36:10,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:10,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:10,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:10,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 16:36:10,538 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 16:36:10,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:10,544 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2025-02-06 16:36:10,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:10,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-02-06 16:36:10,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:10,545 INFO L225 Difference]: With dead ends: 38 [2025-02-06 16:36:10,545 INFO L226 Difference]: Without dead ends: 30 [2025-02-06 16:36:10,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 16:36:10,546 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:10,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 45 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-06 16:36:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-06 16:36:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 16:36:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-02-06 16:36:10,549 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2025-02-06 16:36:10,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:10,551 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-02-06 16:36:10,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 16:36:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-02-06 16:36:10,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 16:36:10,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:10,552 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:10,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 16:36:10,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 16:36:10,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 16:36:10,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:10,754 INFO L85 PathProgramCache]: Analyzing trace with hash -475562051, now seen corresponding path program 1 times [2025-02-06 16:36:10,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:10,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434021347] [2025-02-06 16:36:10,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:10,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:10,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 16:36:10,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 16:36:10,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:10,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 16:36:10,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:10,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434021347] [2025-02-06 16:36:10,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434021347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:10,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:10,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 16:36:10,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88759741] [2025-02-06 16:36:10,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:10,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:10,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:10,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:10,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:10,843 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:36:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:10,852 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-02-06 16:36:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:10,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-02-06 16:36:10,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:10,854 INFO L225 Difference]: With dead ends: 30 [2025-02-06 16:36:10,854 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 16:36:10,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:10,855 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:10,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 16:36:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 16:36:10,857 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-02-06 16:36:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 16:36:10,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2025-02-06 16:36:10,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:10,858 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 16:36:10,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:36:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 16:36:10,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 16:36:10,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-06 16:36:10,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-06 16:36:10,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-06 16:36:10,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-06 16:36:10,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-06 16:36:10,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-06 16:36:10,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 16:36:10,865 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:10,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 16:36:10,907 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 16:36:10,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:36:10 BoogieIcfgContainer [2025-02-06 16:36:10,916 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 16:36:10,917 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 16:36:10,917 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 16:36:10,918 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 16:36:10,918 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:36:09" (3/4) ... [2025-02-06 16:36:10,921 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 16:36:10,924 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-06 16:36:10,924 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-06 16:36:10,928 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-06 16:36:10,930 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 16:36:10,930 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 16:36:10,930 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 16:36:11,012 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 16:36:11,013 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 16:36:11,013 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 16:36:11,014 INFO L158 Benchmark]: Toolchain (without parser) took 2984.88ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 53.0MB in the end (delta: 49.0MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2025-02-06 16:36:11,014 INFO L158 Benchmark]: CDTParser took 1.45ms. Allocated memory is still 201.3MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:36:11,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 799.39ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 40.2MB in the end (delta: 61.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 16:36:11,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.23ms. Allocated memory is still 142.6MB. Free memory was 40.2MB in the beginning and 37.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:36:11,015 INFO L158 Benchmark]: Boogie Preprocessor took 21.39ms. Allocated memory is still 142.6MB. Free memory was 37.5MB in the beginning and 36.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:36:11,016 INFO L158 Benchmark]: IcfgBuilder took 374.33ms. Allocated memory is still 142.6MB. Free memory was 36.1MB in the beginning and 91.4MB in the end (delta: -55.3MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2025-02-06 16:36:11,019 INFO L158 Benchmark]: TraceAbstraction took 1639.36ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 59.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2025-02-06 16:36:11,019 INFO L158 Benchmark]: Witness Printer took 96.14ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 53.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 16:36:11,020 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45ms. Allocated memory is still 201.3MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 799.39ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 40.2MB in the end (delta: 61.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.23ms. Allocated memory is still 142.6MB. Free memory was 40.2MB in the beginning and 37.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.39ms. Allocated memory is still 142.6MB. Free memory was 37.5MB in the beginning and 36.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 374.33ms. Allocated memory is still 142.6MB. Free memory was 36.1MB in the beginning and 91.4MB in the end (delta: -55.3MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1639.36ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 59.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 96.14ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 53.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1641]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1641]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1607]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1607]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 52 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 448 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 252 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 120 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 29/32 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 RESULT: Ultimate proved your program to be correct! [2025-02-06 16:36:11,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE