./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_07_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/CWE191_Integer_Underflow__int_min_multiply_07_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 42392fcf27d06db77132ab815764de0ba36a5902d1317c2b7385d61a6575e546 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:18:02,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:18:02,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:18:02,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:18:02,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:18:02,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:18:02,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:18:02,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:18:02,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:18:02,236 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:18:02,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:18:02,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:18:02,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:18:02,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:18:02,238 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:18:02,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:18:02,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:18:02,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:18:02,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:18:02,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:18:02,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:18:02,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:18:02,239 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:18:02,239 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:18:02,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:18:02,239 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:18:02,239 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:18:02,239 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:18:02,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:18:02,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:18:02,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:18:02,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:18:02,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:18:02,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:18:02,241 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:18:02,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:18:02,241 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:18:02,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:18:02,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:18:02,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:18:02,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:18:02,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:18:02,241 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 -> 42392fcf27d06db77132ab815764de0ba36a5902d1317c2b7385d61a6575e546 [2025-02-08 13:18:02,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:18:02,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:18:02,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:18:02,531 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:18:02,531 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:18:02,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_07_good.i [2025-02-08 13:18:03,881 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87e619d6b/e6b2f1757ba644f6a4c79e44990254c9/FLAG31ce65baf [2025-02-08 13:18:04,275 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:18:04,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_07_good.i [2025-02-08 13:18:04,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87e619d6b/e6b2f1757ba644f6a4c79e44990254c9/FLAG31ce65baf [2025-02-08 13:18:04,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87e619d6b/e6b2f1757ba644f6a4c79e44990254c9 [2025-02-08 13:18:04,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:18:04,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:18:04,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:18:04,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:18:04,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:18:04,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:18:04" (1/1) ... [2025-02-08 13:18:04,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28710e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:04, skipping insertion in model container [2025-02-08 13:18:04,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:18:04" (1/1) ... [2025-02-08 13:18:04,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:18:05,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:18:05,053 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:18:05,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:18:05,227 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:18:05,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05 WrapperNode [2025-02-08 13:18:05,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:18:05,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:18:05,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:18:05,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:18:05,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05" (1/1) ... [2025-02-08 13:18:05,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05" (1/1) ... [2025-02-08 13:18:05,273 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 82 [2025-02-08 13:18:05,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:18:05,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:18:05,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:18:05,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:18:05,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05" (1/1) ... [2025-02-08 13:18:05,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05" (1/1) ... [2025-02-08 13:18:05,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05" (1/1) ... [2025-02-08 13:18:05,291 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 13:18:05,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05" (1/1) ... [2025-02-08 13:18:05,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05" (1/1) ... [2025-02-08 13:18:05,297 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05" (1/1) ... [2025-02-08 13:18:05,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05" (1/1) ... [2025-02-08 13:18:05,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05" (1/1) ... [2025-02-08 13:18:05,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05" (1/1) ... [2025-02-08 13:18:05,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:18:05,307 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:18:05,307 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:18:05,307 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:18:05,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05" (1/1) ... [2025-02-08 13:18:05,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:18:05,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:18:05,338 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-08 13:18:05,340 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-08 13:18:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-08 13:18:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-08 13:18:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 13:18:05,362 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 13:18:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:18:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:18:05,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:18:05,486 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:18:05,488 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:18:05,672 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-02-08 13:18:05,672 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:18:05,685 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:18:05,686 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:18:05,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:18:05 BoogieIcfgContainer [2025-02-08 13:18:05,687 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:18:05,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:18:05,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:18:05,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:18:05,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:18:04" (1/3) ... [2025-02-08 13:18:05,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d49c538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:18:05, skipping insertion in model container [2025-02-08 13:18:05,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:05" (2/3) ... [2025-02-08 13:18:05,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d49c538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:18:05, skipping insertion in model container [2025-02-08 13:18:05,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:18:05" (3/3) ... [2025-02-08 13:18:05,698 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_multiply_07_good.i [2025-02-08 13:18:05,712 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:18:05,715 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_min_multiply_07_good.i that has 3 procedures, 60 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-08 13:18:05,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:18:05,788 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;@78ed9c8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:18:05,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 13:18:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 51 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 13:18:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:18:05,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:18:05,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:18:05,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:18:05,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:18:05,804 INFO L85 PathProgramCache]: Analyzing trace with hash -950754012, now seen corresponding path program 1 times [2025-02-08 13:18:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:18:05,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388835004] [2025-02-08 13:18:05,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:18:05,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:18:05,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:18:05,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:18:05,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:18:05,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:18:06,015 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-08 13:18:06,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:18:06,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388835004] [2025-02-08 13:18:06,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388835004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:18:06,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:18:06,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:18:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356392381] [2025-02-08 13:18:06,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:18:06,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:18:06,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:18:06,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:18:06,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:18:06,043 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 51 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.3333333333333335) 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-08 13:18:06,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:18:06,088 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2025-02-08 13:18:06,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:18:06,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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-08 13:18:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:18:06,096 INFO L225 Difference]: With dead ends: 116 [2025-02-08 13:18:06,096 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 13:18:06,098 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-08 13:18:06,103 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:18:06,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 153 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:18:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 13:18:06,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-02-08 13:18:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 49 states have internal predecessors, (59), 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-08 13:18:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2025-02-08 13:18:06,137 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 12 [2025-02-08 13:18:06,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:18:06,137 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2025-02-08 13:18:06,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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-08 13:18:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2025-02-08 13:18:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:18:06,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:18:06,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:18:06,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:18:06,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:18:06,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:18:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash -949830491, now seen corresponding path program 1 times [2025-02-08 13:18:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:18:06,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089483152] [2025-02-08 13:18:06,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:18:06,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:18:06,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:18:06,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:18:06,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:18:06,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:18:06,212 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-08 13:18:06,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:18:06,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089483152] [2025-02-08 13:18:06,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089483152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:18:06,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:18:06,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:18:06,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756267598] [2025-02-08 13:18:06,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:18:06,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:18:06,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:18:06,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:18:06,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:18:06,217 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) 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-08 13:18:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:18:06,248 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2025-02-08 13:18:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:18:06,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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-08 13:18:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:18:06,249 INFO L225 Difference]: With dead ends: 94 [2025-02-08 13:18:06,250 INFO L226 Difference]: Without dead ends: 45 [2025-02-08 13:18:06,250 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-08 13:18:06,251 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:18:06,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 43 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:18:06,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-08 13:18:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-08 13:18:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.28125) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 13:18:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-02-08 13:18:06,259 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 12 [2025-02-08 13:18:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:18:06,260 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-02-08 13:18:06,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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-08 13:18:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-02-08 13:18:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 13:18:06,262 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:18:06,263 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-08 13:18:06,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 13:18:06,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:18:06,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:18:06,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1581438383, now seen corresponding path program 1 times [2025-02-08 13:18:06,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:18:06,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417048207] [2025-02-08 13:18:06,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:18:06,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:18:06,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 13:18:06,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 13:18:06,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:18:06,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:18:06,364 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-08 13:18:06,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:18:06,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417048207] [2025-02-08 13:18:06,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417048207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:18:06,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:18:06,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:18:06,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238528884] [2025-02-08 13:18:06,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:18:06,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:18:06,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:18:06,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:18:06,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:18:06,366 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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-08 13:18:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:18:06,384 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2025-02-08 13:18:06,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:18:06,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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-08 13:18:06,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:18:06,386 INFO L225 Difference]: With dead ends: 66 [2025-02-08 13:18:06,386 INFO L226 Difference]: Without dead ends: 39 [2025-02-08 13:18:06,386 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-08 13:18:06,387 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:18:06,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:18:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-08 13:18:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-08 13:18:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 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-08 13:18:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-02-08 13:18:06,393 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 22 [2025-02-08 13:18:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:18:06,393 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-02-08 13:18:06,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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-08 13:18:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-02-08 13:18:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 13:18:06,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:18:06,395 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-08 13:18:06,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:18:06,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:18:06,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:18:06,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1328323014, now seen corresponding path program 1 times [2025-02-08 13:18:06,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:18:06,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316474785] [2025-02-08 13:18:06,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:18:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:18:06,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 13:18:06,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 13:18:06,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:18:06,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:18:06,462 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-08 13:18:06,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:18:06,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316474785] [2025-02-08 13:18:06,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316474785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:18:06,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:18:06,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:18:06,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131476609] [2025-02-08 13:18:06,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:18:06,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:18:06,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:18:06,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:18:06,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:18:06,463 INFO L87 Difference]: Start difference. First operand 39 states and 42 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-08 13:18:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:18:06,487 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2025-02-08 13:18:06,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:18:06,488 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-08 13:18:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:18:06,488 INFO L225 Difference]: With dead ends: 39 [2025-02-08 13:18:06,488 INFO L226 Difference]: Without dead ends: 38 [2025-02-08 13:18:06,489 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-08 13:18:06,489 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:18:06,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:18:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-08 13:18:06,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-08 13:18:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 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-08 13:18:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-02-08 13:18:06,494 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 31 [2025-02-08 13:18:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:18:06,494 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-02-08 13:18:06,494 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-08 13:18:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-02-08 13:18:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 13:18:06,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:18:06,495 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, 1] [2025-02-08 13:18:06,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:18:06,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:18:06,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:18:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1771659520, now seen corresponding path program 1 times [2025-02-08 13:18:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:18:06,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278881612] [2025-02-08 13:18:06,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:18:06,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:18:06,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 13:18:06,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 13:18:06,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:18:06,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:18:06,557 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-08 13:18:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:18:06,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278881612] [2025-02-08 13:18:06,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278881612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:18:06,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:18:06,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:18:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010845317] [2025-02-08 13:18:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:18:06,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:18:06,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:18:06,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:18:06,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:18:06,561 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 13:18:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:18:06,578 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2025-02-08 13:18:06,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:18:06,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 32 [2025-02-08 13:18:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:18:06,580 INFO L225 Difference]: With dead ends: 46 [2025-02-08 13:18:06,580 INFO L226 Difference]: Without dead ends: 37 [2025-02-08 13:18:06,580 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-08 13:18:06,580 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:18:06,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:18:06,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-08 13:18:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-08 13:18:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 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-08 13:18:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2025-02-08 13:18:06,605 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 32 [2025-02-08 13:18:06,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:18:06,606 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2025-02-08 13:18:06,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 13:18:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2025-02-08 13:18:06,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 13:18:06,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:18:06,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:18:06,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:18:06,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:18:06,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:18:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash -9444773, now seen corresponding path program 1 times [2025-02-08 13:18:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:18:06,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973845601] [2025-02-08 13:18:06,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:18:06,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:18:06,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 13:18:06,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 13:18:06,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:18:06,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:18:06,673 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-08 13:18:06,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:18:06,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973845601] [2025-02-08 13:18:06,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973845601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:18:06,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:18:06,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:18:06,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153408237] [2025-02-08 13:18:06,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:18:06,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:18:06,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:18:06,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:18:06,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:18:06,679 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:18:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:18:06,692 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2025-02-08 13:18:06,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:18:06,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-02-08 13:18:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:18:06,693 INFO L225 Difference]: With dead ends: 37 [2025-02-08 13:18:06,693 INFO L226 Difference]: Without dead ends: 36 [2025-02-08 13:18:06,693 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-08 13:18:06,694 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:18:06,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:18:06,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-08 13:18:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-08 13:18:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 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-08 13:18:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-02-08 13:18:06,703 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 42 [2025-02-08 13:18:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:18:06,703 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-02-08 13:18:06,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:18:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-02-08 13:18:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 13:18:06,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:18:06,704 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:18:06,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:18:06,705 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:18:06,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:18:06,707 INFO L85 PathProgramCache]: Analyzing trace with hash -292787982, now seen corresponding path program 1 times [2025-02-08 13:18:06,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:18:06,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134144469] [2025-02-08 13:18:06,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:18:06,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:18:06,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 13:18:06,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 13:18:06,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:18:06,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:18:06,775 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-08 13:18:06,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:18:06,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134144469] [2025-02-08 13:18:06,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134144469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:18:06,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:18:06,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:18:06,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590381332] [2025-02-08 13:18:06,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:18:06,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:18:06,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:18:06,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:18:06,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:18:06,778 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:18:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:18:06,788 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-02-08 13:18:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:18:06,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2025-02-08 13:18:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:18:06,790 INFO L225 Difference]: With dead ends: 36 [2025-02-08 13:18:06,791 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 13:18:06,791 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-08 13:18:06,791 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:18:06,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:18:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 13:18:06,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 13:18:06,792 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-08 13:18:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 13:18:06,792 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2025-02-08 13:18:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:18:06,793 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 13:18:06,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:18:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 13:18:06,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 13:18:06,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-08 13:18:06,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-08 13:18:06,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-08 13:18:06,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-08 13:18:06,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-08 13:18:06,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-08 13:18:06,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-08 13:18:06,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-08 13:18:06,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:18:06,804 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:18:06,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 13:18:06,839 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 13:18:06,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:18:06 BoogieIcfgContainer [2025-02-08 13:18:06,846 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 13:18:06,847 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 13:18:06,848 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 13:18:06,848 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 13:18:06,848 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:18:05" (3/4) ... [2025-02-08 13:18:06,850 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 13:18:06,856 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-08 13:18:06,857 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-08 13:18:06,861 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 13:18:06,861 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 13:18:06,862 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 13:18:06,862 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 13:18:06,933 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 13:18:06,933 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 13:18:06,934 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 13:18:06,935 INFO L158 Benchmark]: Toolchain (without parser) took 2622.48ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 82.5MB in the end (delta: 28.0MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2025-02-08 13:18:06,935 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:18:06,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 915.25ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 48.9MB in the end (delta: 61.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-08 13:18:06,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.23ms. Allocated memory is still 142.6MB. Free memory was 48.9MB in the beginning and 46.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:18:06,936 INFO L158 Benchmark]: Boogie Preprocessor took 28.55ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 45.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:18:06,936 INFO L158 Benchmark]: IcfgBuilder took 380.40ms. Allocated memory is still 142.6MB. Free memory was 44.6MB in the beginning and 99.3MB in the end (delta: -54.7MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-02-08 13:18:06,936 INFO L158 Benchmark]: TraceAbstraction took 1157.00ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 89.0MB in the end (delta: 9.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2025-02-08 13:18:06,936 INFO L158 Benchmark]: Witness Printer took 86.47ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 82.5MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:18:06,937 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.29ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 915.25ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 48.9MB in the end (delta: 61.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.23ms. Allocated memory is still 142.6MB. Free memory was 48.9MB in the beginning and 46.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.55ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 45.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 380.40ms. Allocated memory is still 142.6MB. Free memory was 44.6MB in the beginning and 99.3MB in the end (delta: -54.7MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1157.00ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 89.0MB in the end (delta: 9.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Witness Printer took 86.47ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 82.5MB in the end (delta: 6.5MB). 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: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: 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, 60 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 542 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 235 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 307 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, InterpolantAutomatonStates: 21, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 52/52 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 13:18:06,952 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