./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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_postinc_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 ae52c5d582497291c525bb7e5d6f537c4a681411b48fa6449cbc12b3d30c90d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 12:36:01,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 12:36:01,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 12:36:01,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 12:36:01,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 12:36:01,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 12:36:01,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 12:36:01,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 12:36:01,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 12:36:01,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 12:36:01,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 12:36:01,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 12:36:01,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 12:36:01,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 12:36:01,798 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 12:36:01,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 12:36:01,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 12:36:01,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 12:36:01,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 12:36:01,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 12:36:01,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 12:36:01,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 12:36:01,799 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 12:36:01,799 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 12:36:01,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 12:36:01,799 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 12:36:01,799 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 12:36:01,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 12:36:01,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 12:36:01,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 12:36:01,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 12:36:01,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:36:01,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 12:36:01,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 12:36:01,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 12:36:01,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 12:36:01,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 12:36:01,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 12:36:01,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 12:36:01,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 12:36:01,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 12:36:01,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 12:36:01,800 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 -> ae52c5d582497291c525bb7e5d6f537c4a681411b48fa6449cbc12b3d30c90d5 [2025-03-04 12:36:02,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 12:36:02,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 12:36:02,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 12:36:02,039 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 12:36:02,039 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 12:36:02,040 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_postinc_12_bad.i [2025-03-04 12:36:03,220 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9915ec59/e308658f0f4342c4a405228db2eb5f9a/FLAGd9cf4d6e0 [2025-03-04 12:36:03,515 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 12:36:03,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2025-03-04 12:36:03,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9915ec59/e308658f0f4342c4a405228db2eb5f9a/FLAGd9cf4d6e0 [2025-03-04 12:36:03,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9915ec59/e308658f0f4342c4a405228db2eb5f9a [2025-03-04 12:36:03,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 12:36:03,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 12:36:03,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 12:36:03,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 12:36:03,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 12:36:03,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:03" (1/1) ... [2025-03-04 12:36:03,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5989a0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:03, skipping insertion in model container [2025-03-04 12:36:03,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:03" (1/1) ... [2025-03-04 12:36:03,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 12:36:04,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:36:04,023 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 12:36:04,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:36:04,156 INFO L204 MainTranslator]: Completed translation [2025-03-04 12:36:04,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04 WrapperNode [2025-03-04 12:36:04,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 12:36:04,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 12:36:04,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 12:36:04,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 12:36:04,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04" (1/1) ... [2025-03-04 12:36:04,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04" (1/1) ... [2025-03-04 12:36:04,195 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2025-03-04 12:36:04,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 12:36:04,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 12:36:04,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 12:36:04,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 12:36:04,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04" (1/1) ... [2025-03-04 12:36:04,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04" (1/1) ... [2025-03-04 12:36:04,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04" (1/1) ... [2025-03-04 12:36:04,224 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-04 12:36:04,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04" (1/1) ... [2025-03-04 12:36:04,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04" (1/1) ... [2025-03-04 12:36:04,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04" (1/1) ... [2025-03-04 12:36:04,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04" (1/1) ... [2025-03-04 12:36:04,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04" (1/1) ... [2025-03-04 12:36:04,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04" (1/1) ... [2025-03-04 12:36:04,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 12:36:04,236 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 12:36:04,236 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 12:36:04,236 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 12:36:04,237 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04" (1/1) ... [2025-03-04 12:36:04,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:36:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:36:04,259 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-04 12:36:04,262 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-04 12:36:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 12:36:04,276 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 12:36:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2025-03-04 12:36:04,276 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2025-03-04 12:36:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 12:36:04,276 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 12:36:04,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 12:36:04,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 12:36:04,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 12:36:04,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 12:36:04,392 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 12:36:04,393 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 12:36:04,431 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520: havoc #t~nondet87; [2025-03-04 12:36:04,536 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-04 12:36:04,536 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 12:36:04,542 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 12:36:04,543 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 12:36:04,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:04 BoogieIcfgContainer [2025-03-04 12:36:04,543 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 12:36:04,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 12:36:04,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 12:36:04,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 12:36:04,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:36:03" (1/3) ... [2025-03-04 12:36:04,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45da320b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:36:04, skipping insertion in model container [2025-03-04 12:36:04,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04" (2/3) ... [2025-03-04 12:36:04,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45da320b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:36:04, skipping insertion in model container [2025-03-04 12:36:04,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:04" (3/3) ... [2025-03-04 12:36:04,551 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2025-03-04 12:36:04,562 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 12:36:04,564 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-04 12:36:04,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 12:36:04,613 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;@55468afc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 12:36:04,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 12:36:04,616 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-04 12:36:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 12:36:04,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:36:04,620 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-04 12:36:04,620 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-04 12:36:04,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:36:04,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1100604950, now seen corresponding path program 1 times [2025-03-04 12:36:04,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:36:04,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508659703] [2025-03-04 12:36:04,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:36:04,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:36:04,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 12:36:04,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 12:36:04,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:36:04,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:36:04,869 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-04 12:36:04,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:36:04,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508659703] [2025-03-04 12:36:04,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508659703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:36:04,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:36:04,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:36:04,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328993875] [2025-03-04 12:36:04,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:36:04,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:36:04,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:36:04,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:36:04,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:36:04,889 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 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-04 12:36:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:36:04,942 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2025-03-04 12:36:04,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:36:04,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-04 12:36:04,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:36:04,948 INFO L225 Difference]: With dead ends: 62 [2025-03-04 12:36:04,948 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 12:36:04,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:36:04,953 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:36:04,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:36:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 12:36:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2025-03-04 12:36:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 12:36:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-03-04 12:36:04,981 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 21 [2025-03-04 12:36:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:36:04,982 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-04 12:36:04,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-04 12:36:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-03-04 12:36:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 12:36:04,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:36:04,984 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-04 12:36:04,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 12:36:04,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 12:36:04,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:36:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash 240994802, now seen corresponding path program 1 times [2025-03-04 12:36:04,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:36:04,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403227644] [2025-03-04 12:36:04,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:36:04,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:36:04,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 12:36:05,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 12:36:05,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:36:05,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:36:05,076 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-04 12:36:05,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:36:05,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403227644] [2025-03-04 12:36:05,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403227644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:36:05,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:36:05,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:36:05,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151541356] [2025-03-04 12:36:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:36:05,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:36:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:36:05,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:36:05,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:36:05,078 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-04 12:36:05,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:36:05,104 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-03-04 12:36:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:36:05,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2025-03-04 12:36:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:36:05,105 INFO L225 Difference]: With dead ends: 37 [2025-03-04 12:36:05,106 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 12:36:05,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:36:05,107 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:36:05,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:36:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 12:36:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-04 12:36:05,112 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-04 12:36:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2025-03-04 12:36:05,113 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2025-03-04 12:36:05,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:36:05,113 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-03-04 12:36:05,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-04 12:36:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2025-03-04 12:36:05,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 12:36:05,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:36:05,115 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-04 12:36:05,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 12:36:05,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 12:36:05,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:36:05,116 INFO L85 PathProgramCache]: Analyzing trace with hash 617524396, now seen corresponding path program 1 times [2025-03-04 12:36:05,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:36:05,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180058702] [2025-03-04 12:36:05,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:36:05,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:36:05,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 12:36:05,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 12:36:05,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:36:05,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:36:05,257 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-04 12:36:05,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:36:05,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180058702] [2025-03-04 12:36:05,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180058702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:36:05,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:36:05,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:36:05,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962387293] [2025-03-04 12:36:05,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:36:05,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:36:05,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:36:05,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:36:05,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:36:05,258 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-04 12:36:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:36:05,296 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-03-04 12:36:05,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:36:05,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-04 12:36:05,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:36:05,297 INFO L225 Difference]: With dead ends: 29 [2025-03-04 12:36:05,297 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 12:36:05,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:36:05,298 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:36:05,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 69 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:36:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 12:36:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 12:36:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 22 states have internal predecessors, (23), 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-04 12:36:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-03-04 12:36:05,306 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2025-03-04 12:36:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:36:05,306 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-03-04 12:36:05,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-04 12:36:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-03-04 12:36:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 12:36:05,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:36:05,307 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-04 12:36:05,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 12:36:05,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 12:36:05,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:36:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1963387078, now seen corresponding path program 1 times [2025-03-04 12:36:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:36:05,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635074645] [2025-03-04 12:36:05,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:36:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:36:05,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 12:36:05,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 12:36:05,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:36:05,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 12:36:05,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 12:36:05,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 12:36:05,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 12:36:05,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:36:05,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 12:36:05,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 12:36:05,378 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 12:36:05,379 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-04 12:36:05,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-04 12:36:05,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-04 12:36:05,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-04 12:36:05,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 12:36:05,383 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 12:36:05,399 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 12:36:05,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:36:05 BoogieIcfgContainer [2025-03-04 12:36:05,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 12:36:05,402 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 12:36:05,402 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 12:36:05,402 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 12:36:05,403 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:04" (3/4) ... [2025-03-04 12:36:05,405 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 12:36:05,406 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 12:36:05,407 INFO L158 Benchmark]: Toolchain (without parser) took 1846.34ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 99.5MB in the end (delta: 9.7MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2025-03-04 12:36:05,407 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:36:05,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.41ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 51.0MB in the end (delta: 58.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 12:36:05,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.77ms. Allocated memory is still 142.6MB. Free memory was 51.0MB in the beginning and 48.3MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 12:36:05,408 INFO L158 Benchmark]: Boogie Preprocessor took 36.38ms. Allocated memory is still 142.6MB. Free memory was 48.3MB in the beginning and 46.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:36:05,410 INFO L158 Benchmark]: IcfgBuilder took 307.31ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 101.9MB in the end (delta: -55.0MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2025-03-04 12:36:05,410 INFO L158 Benchmark]: TraceAbstraction took 857.25ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:36:05,410 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 99.5MB in the end (delta: 15.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:36:05,411 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.50ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.41ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 51.0MB in the end (delta: 58.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.77ms. Allocated memory is still 142.6MB. Free memory was 51.0MB in the beginning and 48.3MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.38ms. Allocated memory is still 142.6MB. Free memory was 48.3MB in the beginning and 46.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 307.31ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 101.9MB in the end (delta: -55.0MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 857.25ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 99.5MB in the end (delta: 15.6kB). 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_postinc_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, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 299 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 111 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 9/9 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-04 12:36:05,426 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_postinc_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 ae52c5d582497291c525bb7e5d6f537c4a681411b48fa6449cbc12b3d30c90d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 12:36:07,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 12:36:07,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-03-04 12:36:07,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 12:36:07,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 12:36:07,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-03-04 12:36:07,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 12:36:07,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 12:36:07,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 12:36:07,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 12:36:07,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 12:36:07,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 12:36:07,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 12:36:07,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 12:36:07,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 12:36:07,410 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 12:36:07,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 12:36:07,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 12:36:07,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 12:36:07,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 12:36:07,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 12:36:07,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 12:36:07,412 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 12:36:07,412 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 12:36:07,412 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 12:36:07,412 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 12:36:07,412 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 12:36:07,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 12:36:07,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 12:36:07,413 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 12:36:07,413 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 12:36:07,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 12:36:07,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 12:36:07,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 12:36:07,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:36:07,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 12:36:07,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 12:36:07,414 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 12:36:07,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 12:36:07,414 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 12:36:07,414 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 12:36:07,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 12:36:07,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 12:36:07,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 12:36:07,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 12:36:07,415 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 -> ae52c5d582497291c525bb7e5d6f537c4a681411b48fa6449cbc12b3d30c90d5 [2025-03-04 12:36:07,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 12:36:07,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 12:36:07,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 12:36:07,661 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 12:36:07,663 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 12:36:07,664 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_postinc_12_bad.i [2025-03-04 12:36:08,807 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675c2304f/bde831c615524b38ab0bd90ea3044379/FLAGc303ee6a2 [2025-03-04 12:36:09,095 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 12:36:09,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2025-03-04 12:36:09,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675c2304f/bde831c615524b38ab0bd90ea3044379/FLAGc303ee6a2 [2025-03-04 12:36:09,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675c2304f/bde831c615524b38ab0bd90ea3044379 [2025-03-04 12:36:09,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 12:36:09,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 12:36:09,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 12:36:09,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 12:36:09,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 12:36:09,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2daac5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09, skipping insertion in model container [2025-03-04 12:36:09,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 12:36:09,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:36:09,674 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 12:36:09,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:36:09,897 INFO L204 MainTranslator]: Completed translation [2025-03-04 12:36:09,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09 WrapperNode [2025-03-04 12:36:09,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 12:36:09,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 12:36:09,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 12:36:09,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 12:36:09,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,952 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2025-03-04 12:36:09,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 12:36:09,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 12:36:09,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 12:36:09,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 12:36:09,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,979 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-04 12:36:09,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,988 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 12:36:09,993 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 12:36:09,994 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 12:36:09,994 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 12:36:09,994 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09" (1/1) ... [2025-03-04 12:36:09,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:36:10,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:36:10,039 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-04 12:36:10,052 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-04 12:36:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 12:36:10,075 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 12:36:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2025-03-04 12:36:10,075 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2025-03-04 12:36:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 12:36:10,075 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 12:36:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 12:36:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 12:36:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 12:36:10,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 12:36:10,206 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 12:36:10,207 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 12:36:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520: havoc #t~nondet83; [2025-03-04 12:36:10,311 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-04 12:36:10,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 12:36:10,319 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 12:36:10,319 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 12:36:10,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:10 BoogieIcfgContainer [2025-03-04 12:36:10,320 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 12:36:10,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 12:36:10,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 12:36:10,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 12:36:10,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:36:09" (1/3) ... [2025-03-04 12:36:10,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712d1025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:36:10, skipping insertion in model container [2025-03-04 12:36:10,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:09" (2/3) ... [2025-03-04 12:36:10,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712d1025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:36:10, skipping insertion in model container [2025-03-04 12:36:10,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:10" (3/3) ... [2025-03-04 12:36:10,327 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2025-03-04 12:36:10,337 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 12:36:10,338 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i that has 4 procedures, 41 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-04 12:36:10,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 12:36:10,390 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;@13493f4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 12:36:10,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 12:36:10,393 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-04 12:36:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 12:36:10,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:36:10,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:36:10,399 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-04 12:36:10,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:36:10,405 INFO L85 PathProgramCache]: Analyzing trace with hash -454058387, now seen corresponding path program 1 times [2025-03-04 12:36:10,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 12:36:10,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1462303780] [2025-03-04 12:36:10,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:36:10,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:36:10,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:36:10,416 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-04 12:36:10,418 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-04 12:36:10,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 12:36:10,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 12:36:10,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:36:10,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:36:10,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 12:36:10,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:36:10,552 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-04 12:36:10,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:36:10,552 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 12:36:10,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462303780] [2025-03-04 12:36:10,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462303780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:36:10,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:36:10,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 12:36:10,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363001567] [2025-03-04 12:36:10,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:36:10,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 12:36:10,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 12:36:10,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 12:36:10,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 12:36:10,570 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-04 12:36:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:36:10,581 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2025-03-04 12:36:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 12:36:10,582 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-04 12:36:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:36:10,586 INFO L225 Difference]: With dead ends: 41 [2025-03-04 12:36:10,586 INFO L226 Difference]: Without dead ends: 25 [2025-03-04 12:36:10,589 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-04 12:36:10,591 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-04 12:36:10,592 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-04 12:36:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-04 12:36:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-04 12:36:10,615 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-04 12:36:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-04 12:36:10,620 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2025-03-04 12:36:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:36:10,621 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-04 12:36:10,621 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-04 12:36:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-04 12:36:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 12:36:10,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:36:10,623 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-04 12:36:10,630 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-04 12:36:10,825 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-04 12:36:10,825 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-04 12:36:10,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:36:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1190908123, now seen corresponding path program 1 times [2025-03-04 12:36:10,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 12:36:10,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96189194] [2025-03-04 12:36:10,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:36:10,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:36:10,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:36:10,830 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-04 12:36:10,832 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-04 12:36:10,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 12:36:10,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 12:36:10,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:36:10,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:36:10,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 12:36:10,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:36:10,953 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-04 12:36:10,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:36:10,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 12:36:10,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96189194] [2025-03-04 12:36:10,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96189194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:36:10,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:36:10,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:36:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926080803] [2025-03-04 12:36:10,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:36:10,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:36:10,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 12:36:10,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:36:10,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:36:10,956 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-04 12:36:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:36:10,982 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-04 12:36:10,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:36:10,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-04 12:36:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:36:10,984 INFO L225 Difference]: With dead ends: 31 [2025-03-04 12:36:10,984 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 12:36:10,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:36:10,985 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:36:10,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 82 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:36:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 12:36:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-03-04 12:36:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 12:36:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-03-04 12:36:10,991 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 20 [2025-03-04 12:36:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:36:10,992 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-03-04 12:36:10,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-04 12:36:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-03-04 12:36:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 12:36:10,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:36:10,992 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-04 12:36:11,000 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-04 12:36:11,192 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-04 12:36:11,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 12:36:11,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:36:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1736860682, now seen corresponding path program 1 times [2025-03-04 12:36:11,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 12:36:11,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2055165256] [2025-03-04 12:36:11,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:36:11,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:36:11,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:36:11,212 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-04 12:36:11,214 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-04 12:36:11,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 12:36:11,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 12:36:11,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:36:11,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:36:11,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 12:36:11,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:36:11,302 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-04 12:36:11,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:36:11,303 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 12:36:11,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055165256] [2025-03-04 12:36:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055165256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:36:11,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:36:11,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:36:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565883036] [2025-03-04 12:36:11,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:36:11,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:36:11,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 12:36:11,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:36:11,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:36:11,304 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-04 12:36:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:36:11,317 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-03-04 12:36:11,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:36:11,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-04 12:36:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:36:11,318 INFO L225 Difference]: With dead ends: 31 [2025-03-04 12:36:11,318 INFO L226 Difference]: Without dead ends: 25 [2025-03-04 12:36:11,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:36:11,319 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:36:11,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:36:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-04 12:36:11,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-04 12:36:11,321 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-04 12:36:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-04 12:36:11,322 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2025-03-04 12:36:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:36:11,322 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-04 12:36:11,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-04 12:36:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-04 12:36:11,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 12:36:11,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:36:11,323 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-04 12:36:11,329 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-04 12:36:11,527 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-04 12:36:11,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 12:36:11,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:36:11,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1227375481, now seen corresponding path program 1 times [2025-03-04 12:36:11,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 12:36:11,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1291549749] [2025-03-04 12:36:11,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:36:11,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:36:11,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:36:11,530 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 12:36:11,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 12:36:11,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 12:36:11,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 12:36:11,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:36:11,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 12:36:11,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 12:36:11,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 12:36:11,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 12:36:11,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:36:11,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 12:36:11,635 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 12:36:11,637 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 12:36:11,638 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-04 12:36:11,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-04 12:36:11,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-04 12:36:11,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-04 12:36:11,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 12:36:11,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:36:11,842 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 12:36:11,857 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 12:36:11,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:36:11 BoogieIcfgContainer [2025-03-04 12:36:11,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 12:36:11,862 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 12:36:11,862 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 12:36:11,862 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 12:36:11,863 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:10" (3/4) ... [2025-03-04 12:36:11,864 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 12:36:11,865 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 12:36:11,866 INFO L158 Benchmark]: Toolchain (without parser) took 2734.46ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 48.6MB in the end (delta: 40.8MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2025-03-04 12:36:11,866 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:36:11,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 766.15ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 76.0MB in the end (delta: 13.3MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2025-03-04 12:36:11,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.52ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:36:11,866 INFO L158 Benchmark]: Boogie Preprocessor took 39.09ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 70.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 12:36:11,866 INFO L158 Benchmark]: IcfgBuilder took 326.31ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 56.2MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 12:36:11,866 INFO L158 Benchmark]: TraceAbstraction took 1540.36ms. Allocated memory is still 117.4MB. Free memory was 55.5MB in the beginning and 49.2MB in the end (delta: 6.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2025-03-04 12:36:11,866 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 117.4MB. Free memory was 49.2MB in the beginning and 48.6MB in the end (delta: 649.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:36:11,868 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 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 766.15ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 76.0MB in the end (delta: 13.3MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.52ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.09ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 70.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 326.31ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 56.2MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1540.36ms. Allocated memory is still 117.4MB. Free memory was 55.5MB in the beginning and 49.2MB in the end (delta: 6.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 117.4MB. Free memory was 49.2MB in the beginning and 48.6MB in the end (delta: 649.2kB). 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_postinc_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, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 212 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 110 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 SizeOfPredicates, 0 NumberOfNonLiveVariables, 183 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 9/9 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-04 12:36:11,880 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