./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_04_bad.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_rand_add_04_bad.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 3c3ce8348995b831aa1433d89fb0ec380ad3ea35819fcc75e231cc181816b768 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 16:39:56,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 16:39:56,814 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:39:56,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 16:39:56,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 16:39:56,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 16:39:56,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 16:39:56,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 16:39:56,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 16:39:56,847 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 16:39:56,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 16:39:56,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 16:39:56,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 16:39:56,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 16:39:56,849 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 16:39:56,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 16:39:56,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 16:39:56,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 16:39:56,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 16:39:56,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 16:39:56,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 16:39:56,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 16:39:56,850 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 16:39:56,850 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 16:39:56,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 16:39:56,850 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 16:39:56,850 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 16:39:56,850 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 16:39:56,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 16:39:56,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 16:39:56,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 16:39:56,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 16:39:56,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 16:39:56,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 16:39:56,851 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 16:39:56,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 16:39:56,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 16:39:56,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 16:39:56,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 16:39:56,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 16:39:56,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 16:39:56,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 16:39:56,852 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 -> 3c3ce8348995b831aa1433d89fb0ec380ad3ea35819fcc75e231cc181816b768 [2025-02-06 16:39:57,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 16:39:57,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 16:39:57,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 16:39:57,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 16:39:57,113 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 16:39:57,115 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_rand_add_04_bad.i [2025-02-06 16:39:58,362 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/308b2e80e/54bbbf9647684f688932ca555c2bcf2d/FLAG62b574286 [2025-02-06 16:39:58,737 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 16:39:58,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_04_bad.i [2025-02-06 16:39:58,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/308b2e80e/54bbbf9647684f688932ca555c2bcf2d/FLAG62b574286 [2025-02-06 16:39:58,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/308b2e80e/54bbbf9647684f688932ca555c2bcf2d [2025-02-06 16:39:58,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 16:39:58,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 16:39:58,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 16:39:58,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 16:39:58,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 16:39:58,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:39:58" (1/1) ... [2025-02-06 16:39:58,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66777e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:58, skipping insertion in model container [2025-02-06 16:39:58,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:39:58" (1/1) ... [2025-02-06 16:39:58,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 16:39:59,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 16:39:59,521 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 16:39:59,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 16:39:59,714 INFO L204 MainTranslator]: Completed translation [2025-02-06 16:39:59,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:59 WrapperNode [2025-02-06 16:39:59,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 16:39:59,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 16:39:59,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 16:39:59,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 16:39:59,721 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:39:59" (1/1) ... [2025-02-06 16:39:59,738 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:39:59" (1/1) ... [2025-02-06 16:39:59,755 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2025-02-06 16:39:59,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 16:39:59,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 16:39:59,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 16:39:59,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 16:39:59,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:59" (1/1) ... [2025-02-06 16:39:59,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:59" (1/1) ... [2025-02-06 16:39:59,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:59" (1/1) ... [2025-02-06 16:39:59,779 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 16:39:59,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:59" (1/1) ... [2025-02-06 16:39:59,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:59" (1/1) ... [2025-02-06 16:39:59,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:59" (1/1) ... [2025-02-06 16:39:59,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:59" (1/1) ... [2025-02-06 16:39:59,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:59" (1/1) ... [2025-02-06 16:39:59,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:59" (1/1) ... [2025-02-06 16:39:59,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 16:39:59,796 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 16:39:59,796 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 16:39:59,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 16:39:59,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:59" (1/1) ... [2025-02-06 16:39:59,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 16:39:59,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 16:39:59,820 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:39:59,823 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:39:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-06 16:39:59,842 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-06 16:39:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 16:39:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 16:39:59,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 16:39:59,954 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 16:39:59,956 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 16:40:00,083 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-02-06 16:40:00,083 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 16:40:00,098 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 16:40:00,098 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 16:40:00,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:40:00 BoogieIcfgContainer [2025-02-06 16:40:00,099 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 16:40:00,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 16:40:00,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 16:40:00,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 16:40:00,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:39:58" (1/3) ... [2025-02-06 16:40:00,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2355d854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:40:00, skipping insertion in model container [2025-02-06 16:40:00,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:59" (2/3) ... [2025-02-06 16:40:00,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2355d854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:40:00, skipping insertion in model container [2025-02-06 16:40:00,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:40:00" (3/3) ... [2025-02-06 16:40:00,107 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_04_bad.i [2025-02-06 16:40:00,117 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 16:40:00,118 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_add_04_bad.i that has 2 procedures, 43 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-06 16:40:00,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 16:40:00,172 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;@384b9f9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 16:40:00,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 16:40:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 39 states have internal predecessors, (55), 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:40:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 16:40:00,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:40:00,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:40:00,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-06 16:40:00,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:40:00,185 INFO L85 PathProgramCache]: Analyzing trace with hash 602142074, now seen corresponding path program 1 times [2025-02-06 16:40:00,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:40:00,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669395333] [2025-02-06 16:40:00,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:40:00,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:40:00,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 16:40:00,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 16:40:00,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:40:00,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:40:00,434 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:40:00,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:40:00,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669395333] [2025-02-06 16:40:00,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669395333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:40:00,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:40:00,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 16:40:00,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914391442] [2025-02-06 16:40:00,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:40:00,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 16:40:00,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:40:00,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 16:40:00,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 16:40:00,451 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 39 states have internal predecessors, (55), 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) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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:40:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:40:00,526 INFO L93 Difference]: Finished difference Result 83 states and 116 transitions. [2025-02-06 16:40:00,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 16:40:00,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2025-02-06 16:40:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:40:00,531 INFO L225 Difference]: With dead ends: 83 [2025-02-06 16:40:00,531 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 16:40:00,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 16:40:00,535 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 53 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:40:00,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 133 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:40:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 16:40:00,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-06 16:40:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 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:40:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-02-06 16:40:00,564 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 11 [2025-02-06 16:40:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:40:00,565 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-02-06 16:40:00,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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:40:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-02-06 16:40:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 16:40:00,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:40:00,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:40:00,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 16:40:00,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-06 16:40:00,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:40:00,569 INFO L85 PathProgramCache]: Analyzing trace with hash -46166488, now seen corresponding path program 1 times [2025-02-06 16:40:00,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:40:00,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514784524] [2025-02-06 16:40:00,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:40:00,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:40:00,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 16:40:00,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 16:40:00,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:40:00,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:40:00,780 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:40:00,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:40:00,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514784524] [2025-02-06 16:40:00,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514784524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:40:00,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:40:00,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 16:40:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140019964] [2025-02-06 16:40:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:40:00,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 16:40:00,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:40:00,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 16:40:00,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 16:40:00,782 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:40:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:40:00,857 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2025-02-06 16:40:00,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 16:40:00,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 17 [2025-02-06 16:40:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:40:00,858 INFO L225 Difference]: With dead ends: 42 [2025-02-06 16:40:00,858 INFO L226 Difference]: Without dead ends: 41 [2025-02-06 16:40:00,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 16:40:00,858 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 40 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:40:00,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 142 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:40:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-06 16:40:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-02-06 16:40:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 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:40:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2025-02-06 16:40:00,862 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 17 [2025-02-06 16:40:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:40:00,862 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-02-06 16:40:00,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:40:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2025-02-06 16:40:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 16:40:00,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:40:00,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:40:00,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 16:40:00,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-06 16:40:00,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:40:00,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1047740939, now seen corresponding path program 1 times [2025-02-06 16:40:00,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:40:00,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449960524] [2025-02-06 16:40:00,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:40:00,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:40:00,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 16:40:00,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 16:40:00,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:40:00,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:40:00,942 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:40:00,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:40:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449960524] [2025-02-06 16:40:00,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449960524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:40:00,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:40:00,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 16:40:00,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300075716] [2025-02-06 16:40:00,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:40:00,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:40:00,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:40:00,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:40:00,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:40:00,944 INFO L87 Difference]: Start difference. First operand 40 states and 52 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, (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:40:00,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:40:00,953 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2025-02-06 16:40:00,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:40:00,955 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, (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 17 [2025-02-06 16:40:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:40:00,955 INFO L225 Difference]: With dead ends: 40 [2025-02-06 16:40:00,955 INFO L226 Difference]: Without dead ends: 39 [2025-02-06 16:40:00,955 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:40:00,956 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:40:00,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 48 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:40:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-06 16:40:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-02-06 16:40:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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:40:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2025-02-06 16:40:00,963 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 17 [2025-02-06 16:40:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:40:00,963 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2025-02-06 16:40:00,963 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, (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:40:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2025-02-06 16:40:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 16:40:00,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:40:00,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:40:00,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 16:40:00,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-06 16:40:00,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:40:00,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1431161148, now seen corresponding path program 1 times [2025-02-06 16:40:00,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:40:00,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156064977] [2025-02-06 16:40:00,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:40:00,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:40:00,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 16:40:00,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 16:40:00,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:40:00,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 16:40:00,986 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 16:40:00,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 16:40:00,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 16:40:00,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:40:00,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 16:40:01,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 16:40:01,016 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 16:40:01,016 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-02-06 16:40:01,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-02-06 16:40:01,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 16:40:01,019 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 16:40:01,041 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 16:40:01,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:40:01 BoogieIcfgContainer [2025-02-06 16:40:01,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 16:40:01,045 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 16:40:01,045 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 16:40:01,045 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 16:40:01,046 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:40:00" (3/4) ... [2025-02-06 16:40:01,047 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 16:40:01,084 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 7. [2025-02-06 16:40:01,120 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 16:40:01,121 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 16:40:01,121 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 16:40:01,123 INFO L158 Benchmark]: Toolchain (without parser) took 2339.64ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 81.6MB in the end (delta: 23.7MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2025-02-06 16:40:01,124 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:40:01,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 931.22ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 46.3MB in the end (delta: 59.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 16:40:01,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.63ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 43.4MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 16:40:01,125 INFO L158 Benchmark]: Boogie Preprocessor took 39.46ms. Allocated memory is still 142.6MB. Free memory was 43.4MB in the beginning and 41.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:40:01,125 INFO L158 Benchmark]: IcfgBuilder took 303.32ms. Allocated memory is still 142.6MB. Free memory was 41.9MB in the beginning and 95.3MB in the end (delta: -53.5MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-02-06 16:40:01,126 INFO L158 Benchmark]: TraceAbstraction took 943.90ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 88.3MB in the end (delta: 6.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2025-02-06 16:40:01,126 INFO L158 Benchmark]: Witness Printer took 76.66ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 81.6MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 16:40:01,128 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.28ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 931.22ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 46.3MB in the end (delta: 59.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.63ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 43.4MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.46ms. Allocated memory is still 142.6MB. Free memory was 43.4MB in the beginning and 41.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 303.32ms. Allocated memory is still 142.6MB. Free memory was 41.9MB in the beginning and 95.3MB in the end (delta: -53.5MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 943.90ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 88.3MB in the end (delta: 6.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 76.66ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 81.6MB in the end (delta: 6.7MB). 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 - CounterExampleResult [Line: 1561]: integer overflow possible integer overflow possible We found a FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1548] static const int STATIC_CONST_TRUE = 1; [L1549] static const int STATIC_CONST_FALSE = 0; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_rand_add_04_bad() [L1552] int data; [L1553] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] COND TRUE \read(STATIC_CONST_TRUE) [L1556] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1556] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1558] COND TRUE \read(STATIC_CONST_TRUE) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1561] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 122 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-06 16:40:01,148 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)