./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b91dae833bbe914f6db858614925f2e5ed6a0d4828d26d06ca221fba91b27025 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 03:49:44,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 03:49:44,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 03:49:44,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 03:49:44,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 03:49:44,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 03:49:44,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 03:49:44,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 03:49:44,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 03:49:44,798 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 03:49:44,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 03:49:44,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 03:49:44,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 03:49:44,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 03:49:44,799 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 03:49:44,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 03:49:44,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 03:49:44,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 03:49:44,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 03:49:44,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 03:49:44,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 03:49:44,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 03:49:44,800 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 03:49:44,800 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 03:49:44,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 03:49:44,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:49:44,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 03:49:44,801 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b91dae833bbe914f6db858614925f2e5ed6a0d4828d26d06ca221fba91b27025 [2025-03-09 03:49:45,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 03:49:45,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 03:49:45,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 03:49:45,052 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 03:49:45,053 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 03:49:45,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2025-03-09 03:49:46,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a354ce28/60cd8aa2177545e2b0f279d793e24a0c/FLAGfb521e701 [2025-03-09 03:49:46,715 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 03:49:46,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2025-03-09 03:49:46,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a354ce28/60cd8aa2177545e2b0f279d793e24a0c/FLAGfb521e701 [2025-03-09 03:49:46,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a354ce28/60cd8aa2177545e2b0f279d793e24a0c [2025-03-09 03:49:46,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 03:49:46,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 03:49:46,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 03:49:46,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 03:49:46,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 03:49:46,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:49:46" (1/1) ... [2025-03-09 03:49:46,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b640b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:46, skipping insertion in model container [2025-03-09 03:49:46,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:49:46" (1/1) ... [2025-03-09 03:49:46,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 03:49:47,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:49:47,352 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 03:49:47,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:49:47,506 INFO L204 MainTranslator]: Completed translation [2025-03-09 03:49:47,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47 WrapperNode [2025-03-09 03:49:47,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 03:49:47,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 03:49:47,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 03:49:47,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 03:49:47,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47" (1/1) ... [2025-03-09 03:49:47,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47" (1/1) ... [2025-03-09 03:49:47,544 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2025-03-09 03:49:47,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 03:49:47,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 03:49:47,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 03:49:47,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 03:49:47,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47" (1/1) ... [2025-03-09 03:49:47,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47" (1/1) ... [2025-03-09 03:49:47,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47" (1/1) ... [2025-03-09 03:49:47,563 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-09 03:49:47,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47" (1/1) ... [2025-03-09 03:49:47,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47" (1/1) ... [2025-03-09 03:49:47,568 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47" (1/1) ... [2025-03-09 03:49:47,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47" (1/1) ... [2025-03-09 03:49:47,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47" (1/1) ... [2025-03-09 03:49:47,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47" (1/1) ... [2025-03-09 03:49:47,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 03:49:47,572 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 03:49:47,572 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 03:49:47,572 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 03:49:47,573 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47" (1/1) ... [2025-03-09 03:49:47,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:49:47,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:49:47,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 03:49:47,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 03:49:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 03:49:47,615 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 03:49:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2025-03-09 03:49:47,615 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2025-03-09 03:49:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 03:49:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 03:49:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 03:49:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 03:49:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 03:49:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 03:49:47,730 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 03:49:47,731 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 03:49:47,768 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520: havoc #t~nondet87; [2025-03-09 03:49:47,870 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-09 03:49:47,870 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 03:49:47,878 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 03:49:47,879 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 03:49:47,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:49:47 BoogieIcfgContainer [2025-03-09 03:49:47,879 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 03:49:47,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 03:49:47,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 03:49:47,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 03:49:47,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:49:46" (1/3) ... [2025-03-09 03:49:47,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf0f1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:49:47, skipping insertion in model container [2025-03-09 03:49:47,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:47" (2/3) ... [2025-03-09 03:49:47,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf0f1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:49:47, skipping insertion in model container [2025-03-09 03:49:47,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:49:47" (3/3) ... [2025-03-09 03:49:47,888 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2025-03-09 03:49:47,903 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 03:49:47,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-09 03:49:47,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 03:49:47,958 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;@605ca4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 03:49:47,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 03:49:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 03:49:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 03:49:47,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:47,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:47,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 03:49:47,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:47,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1100604950, now seen corresponding path program 1 times [2025-03-09 03:49:47,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:47,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125111055] [2025-03-09 03:49:47,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:47,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:48,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 03:49:48,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 03:49:48,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:48,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 03:49:48,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:48,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125111055] [2025-03-09 03:49:48,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125111055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:48,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:48,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:49:48,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838300421] [2025-03-09 03:49:48,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:48,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:48,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:48,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:48,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:48,233 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 03:49:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:48,289 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2025-03-09 03:49:48,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:48,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2025-03-09 03:49:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:48,295 INFO L225 Difference]: With dead ends: 66 [2025-03-09 03:49:48,295 INFO L226 Difference]: Without dead ends: 29 [2025-03-09 03:49:48,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:48,301 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:48,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-09 03:49:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-09 03:49:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.263157894736842) internal successors, (24), 23 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 03:49:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2025-03-09 03:49:48,334 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 21 [2025-03-09 03:49:48,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:48,335 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-03-09 03:49:48,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 03:49:48,335 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2025-03-09 03:49:48,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 03:49:48,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:48,336 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:48,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 03:49:48,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 03:49:48,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash 617524396, now seen corresponding path program 1 times [2025-03-09 03:49:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:48,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844175391] [2025-03-09 03:49:48,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:48,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:48,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 03:49:48,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 03:49:48,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:48,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 03:49:48,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:48,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844175391] [2025-03-09 03:49:48,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844175391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:48,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:48,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:49:48,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25139299] [2025-03-09 03:49:48,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:48,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:48,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:48,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:48,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:48,476 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 03:49:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:48,502 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-03-09 03:49:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:48,503 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2025-03-09 03:49:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:48,503 INFO L225 Difference]: With dead ends: 29 [2025-03-09 03:49:48,503 INFO L226 Difference]: Without dead ends: 27 [2025-03-09 03:49:48,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:48,505 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:48,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 38 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-09 03:49:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-09 03:49:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 03:49:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-03-09 03:49:48,513 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2025-03-09 03:49:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:48,514 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-03-09 03:49:48,514 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 03:49:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-03-09 03:49:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 03:49:48,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:48,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:48,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 03:49:48,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 03:49:48,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1963387078, now seen corresponding path program 1 times [2025-03-09 03:49:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917372318] [2025-03-09 03:49:48,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:48,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:48,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 03:49:48,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 03:49:48,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:48,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:49:48,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 03:49:48,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 03:49:48,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 03:49:48,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:48,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:49:48,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 03:49:48,592 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 03:49:48,592 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-09 03:49:48,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-09 03:49:48,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-09 03:49:48,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-09 03:49:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 03:49:48,598 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 03:49:48,618 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 03:49:48,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:49:48 BoogieIcfgContainer [2025-03-09 03:49:48,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 03:49:48,624 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 03:49:48,624 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 03:49:48,624 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 03:49:48,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:49:47" (3/4) ... [2025-03-09 03:49:48,626 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 03:49:48,627 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 03:49:48,628 INFO L158 Benchmark]: Toolchain (without parser) took 1867.08ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 80.7MB in the end (delta: 43.6MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2025-03-09 03:49:48,628 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 192.9MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:48,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 743.48ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 64.3MB in the end (delta: 59.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-09 03:49:48,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.77ms. Allocated memory is still 167.8MB. Free memory was 64.3MB in the beginning and 61.5MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 03:49:48,629 INFO L158 Benchmark]: Boogie Preprocessor took 26.13ms. Allocated memory is still 167.8MB. Free memory was 61.5MB in the beginning and 60.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:48,630 INFO L158 Benchmark]: IcfgBuilder took 307.64ms. Allocated memory is still 167.8MB. Free memory was 60.0MB in the beginning and 46.2MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 03:49:48,630 INFO L158 Benchmark]: TraceAbstraction took 742.20ms. Allocated memory is still 167.8MB. Free memory was 45.8MB in the beginning and 80.7MB in the end (delta: -34.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:48,630 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 167.8MB. Free memory was 80.7MB in the beginning and 80.7MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:48,631 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 192.9MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 743.48ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 64.3MB in the end (delta: 59.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.77ms. Allocated memory is still 167.8MB. Free memory was 64.3MB in the beginning and 61.5MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.13ms. Allocated memory is still 167.8MB. Free memory was 61.5MB in the beginning and 60.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 307.64ms. Allocated memory is still 167.8MB. Free memory was 60.0MB in the beginning and 46.2MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 742.20ms. Allocated memory is still 167.8MB. Free memory was 45.8MB in the beginning and 80.7MB in the end (delta: -34.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 167.8MB. Free memory was 80.7MB in the beginning and 80.7MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of fgets at line 1556. Possible 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); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1595] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1595] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1596] CALL CWE190_Integer_Overflow__int_fgets_preinc_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: 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 4 procedures, 43 locations, 60 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 72 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 70 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 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 could not prove your program: unable to determine feasibility of some traces [2025-03-09 03:49:48,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b91dae833bbe914f6db858614925f2e5ed6a0d4828d26d06ca221fba91b27025 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 03:49:50,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 03:49:50,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-03-09 03:49:50,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 03:49:50,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 03:49:50,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-03-09 03:49:50,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 03:49:50,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 03:49:50,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 03:49:50,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 03:49:50,898 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 03:49:50,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 03:49:50,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 03:49:50,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 03:49:50,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 03:49:50,899 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 03:49:50,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 03:49:50,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 03:49:50,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 03:49:50,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 03:49:50,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 03:49:50,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 03:49:50,900 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 03:49:50,900 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 03:49:50,900 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 03:49:50,900 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 03:49:50,900 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 03:49:50,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 03:49:50,900 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 03:49:50,900 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 03:49:50,901 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 03:49:50,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 03:49:50,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 03:49:50,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 03:49:50,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:49:50,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 03:49:50,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 03:49:50,902 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 03:49:50,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 03:49:50,902 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 03:49:50,902 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 03:49:50,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 03:49:50,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 03:49:50,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 03:49:50,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 03:49:50,903 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b91dae833bbe914f6db858614925f2e5ed6a0d4828d26d06ca221fba91b27025 [2025-03-09 03:49:51,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 03:49:51,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 03:49:51,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 03:49:51,166 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 03:49:51,166 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 03:49:51,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2025-03-09 03:49:52,462 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540224d5a/8b90ded4019d47a5979464707f9a5b3a/FLAGa625744b3 [2025-03-09 03:49:52,872 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 03:49:52,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2025-03-09 03:49:52,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540224d5a/8b90ded4019d47a5979464707f9a5b3a/FLAGa625744b3 [2025-03-09 03:49:52,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540224d5a/8b90ded4019d47a5979464707f9a5b3a [2025-03-09 03:49:52,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 03:49:52,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 03:49:52,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 03:49:52,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 03:49:52,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 03:49:52,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fdf1f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52, skipping insertion in model container [2025-03-09 03:49:52,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 03:49:53,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:49:53,577 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 03:49:53,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:49:53,755 INFO L204 MainTranslator]: Completed translation [2025-03-09 03:49:53,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53 WrapperNode [2025-03-09 03:49:53,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 03:49:53,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 03:49:53,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 03:49:53,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 03:49:53,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53" (1/1) ... [2025-03-09 03:49:53,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53" (1/1) ... [2025-03-09 03:49:53,797 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2025-03-09 03:49:53,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 03:49:53,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 03:49:53,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 03:49:53,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 03:49:53,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53" (1/1) ... [2025-03-09 03:49:53,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53" (1/1) ... [2025-03-09 03:49:53,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53" (1/1) ... [2025-03-09 03:49:53,823 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-09 03:49:53,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53" (1/1) ... [2025-03-09 03:49:53,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53" (1/1) ... [2025-03-09 03:49:53,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53" (1/1) ... [2025-03-09 03:49:53,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53" (1/1) ... [2025-03-09 03:49:53,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53" (1/1) ... [2025-03-09 03:49:53,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53" (1/1) ... [2025-03-09 03:49:53,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 03:49:53,844 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 03:49:53,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 03:49:53,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 03:49:53,845 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53" (1/1) ... [2025-03-09 03:49:53,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:49:53,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:49:53,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 03:49:53,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 03:49:53,895 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 03:49:53,895 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 03:49:53,895 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2025-03-09 03:49:53,895 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2025-03-09 03:49:53,896 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 03:49:53,896 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 03:49:53,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 03:49:53,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 03:49:53,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 03:49:53,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 03:49:54,006 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 03:49:54,008 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 03:49:54,033 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520: havoc #t~nondet83; [2025-03-09 03:49:54,132 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-09 03:49:54,132 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 03:49:54,143 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 03:49:54,143 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 03:49:54,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:49:54 BoogieIcfgContainer [2025-03-09 03:49:54,143 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 03:49:54,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 03:49:54,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 03:49:54,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 03:49:54,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:49:52" (1/3) ... [2025-03-09 03:49:54,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642ed54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:49:54, skipping insertion in model container [2025-03-09 03:49:54,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:53" (2/3) ... [2025-03-09 03:49:54,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642ed54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:49:54, skipping insertion in model container [2025-03-09 03:49:54,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:49:54" (3/3) ... [2025-03-09 03:49:54,153 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2025-03-09 03:49:54,165 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 03:49:54,166 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i that has 4 procedures, 41 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-09 03:49:54,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 03:49:54,212 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;@19307ae0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 03:49:54,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 03:49:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.36) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 03:49:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 03:49:54,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:54,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:54,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 03:49:54,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:54,227 INFO L85 PathProgramCache]: Analyzing trace with hash -454058387, now seen corresponding path program 1 times [2025-03-09 03:49:54,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 03:49:54,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1029491025] [2025-03-09 03:49:54,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:54,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:49:54,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:49:54,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:49:54,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 03:49:54,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 03:49:54,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 03:49:54,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:54,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:54,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 03:49:54,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 03:49:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 03:49:54,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 03:49:54,419 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 03:49:54,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029491025] [2025-03-09 03:49:54,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029491025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:54,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:54,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 03:49:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068692354] [2025-03-09 03:49:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:54,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 03:49:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 03:49:54,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 03:49:54,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 03:49:54,450 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.36) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 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-03-09 03:49:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:54,462 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2025-03-09 03:49:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 03:49:54,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 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 19 [2025-03-09 03:49:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:54,468 INFO L225 Difference]: With dead ends: 41 [2025-03-09 03:49:54,469 INFO L226 Difference]: Without dead ends: 25 [2025-03-09 03:49:54,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 03:49:54,473 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:54,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-09 03:49:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-09 03:49:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 03:49:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-09 03:49:54,504 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2025-03-09 03:49:54,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:54,506 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-09 03:49:54,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 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-03-09 03:49:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-09 03:49:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 03:49:54,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:54,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:54,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 03:49:54,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:49:54,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 03:49:54,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:54,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1190908123, now seen corresponding path program 1 times [2025-03-09 03:49:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 03:49:54,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1855551019] [2025-03-09 03:49:54,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:54,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:49:54,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:49:54,719 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:49:54,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 03:49:54,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 03:49:54,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 03:49:54,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:54,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:54,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 03:49:54,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 03:49:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 03:49:54,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 03:49:54,813 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 03:49:54,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855551019] [2025-03-09 03:49:54,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855551019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:54,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:54,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:49:54,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620773921] [2025-03-09 03:49:54,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:54,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 03:49:54,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:54,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:54,816 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 03:49:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:54,846 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-03-09 03:49:54,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:54,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2025-03-09 03:49:54,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:54,847 INFO L225 Difference]: With dead ends: 34 [2025-03-09 03:49:54,848 INFO L226 Difference]: Without dead ends: 25 [2025-03-09 03:49:54,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:54,849 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:54,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 47 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:54,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-09 03:49:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-09 03:49:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 03:49:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-09 03:49:54,855 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2025-03-09 03:49:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:54,855 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-09 03:49:54,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 03:49:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-09 03:49:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 03:49:54,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:54,858 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:54,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 03:49:55,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:49:55,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 03:49:55,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1227375481, now seen corresponding path program 1 times [2025-03-09 03:49:55,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 03:49:55,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [834276716] [2025-03-09 03:49:55,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:55,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:49:55,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:49:55,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:49:55,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 03:49:55,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 03:49:55,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 03:49:55,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:55,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:49:55,145 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 03:49:55,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 03:49:55,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 03:49:55,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:55,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:49:55,207 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 03:49:55,207 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 03:49:55,207 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-09 03:49:55,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-09 03:49:55,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-09 03:49:55,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-09 03:49:55,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 03:49:55,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:49:55,412 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 03:49:55,431 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 03:49:55,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:49:55 BoogieIcfgContainer [2025-03-09 03:49:55,434 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 03:49:55,435 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 03:49:55,435 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 03:49:55,435 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 03:49:55,436 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:49:54" (3/4) ... [2025-03-09 03:49:55,438 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 03:49:55,438 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 03:49:55,439 INFO L158 Benchmark]: Toolchain (without parser) took 2524.08ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 59.4MB in the end (delta: 28.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 03:49:55,439 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:55,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 839.41ms. Allocated memory is still 117.4MB. Free memory was 88.1MB in the beginning and 67.3MB in the end (delta: 20.9MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2025-03-09 03:49:55,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.95ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 64.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:55,440 INFO L158 Benchmark]: Boogie Preprocessor took 45.39ms. Allocated memory is still 117.4MB. Free memory was 64.2MB in the beginning and 62.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:55,440 INFO L158 Benchmark]: IcfgBuilder took 299.14ms. Allocated memory is still 117.4MB. Free memory was 62.1MB in the beginning and 46.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 03:49:55,440 INFO L158 Benchmark]: TraceAbstraction took 1286.41ms. Allocated memory is still 117.4MB. Free memory was 46.3MB in the beginning and 59.4MB in the end (delta: -13.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:55,440 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 117.4MB. Free memory was 59.4MB in the beginning and 59.4MB in the end (delta: 30.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:55,442 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.24ms. Allocated memory is still 117.4MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 839.41ms. Allocated memory is still 117.4MB. Free memory was 88.1MB in the beginning and 67.3MB in the end (delta: 20.9MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.95ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 64.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.39ms. Allocated memory is still 117.4MB. Free memory was 64.2MB in the beginning and 62.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 299.14ms. Allocated memory is still 117.4MB. Free memory was 62.1MB in the beginning and 46.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1286.41ms. Allocated memory is still 117.4MB. Free memory was 46.3MB in the beginning and 59.4MB in the end (delta: -13.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 117.4MB. Free memory was 59.4MB in the beginning and 59.4MB in the end (delta: 30.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of fgets at line 1556. Possible 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); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1595] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1595] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1596] CALL CWE190_Integer_Overflow__int_fgets_preinc_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: 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 4 procedures, 41 locations, 58 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 74 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 45 SizeOfPredicates, 0 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 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 could not prove your program: unable to determine feasibility of some traces [2025-03-09 03:49:55,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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: UNKNOWN: Overapproximated counterexample