./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_square_08_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_square_08_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 aa3605b34b0253b1f3c1c66572f8bf88a65afb1f8dcc06ae4ec10c63433c4213 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 03:50:41,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 03:50:41,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 03:50:41,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 03:50:41,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 03:50:41,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 03:50:41,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 03:50:41,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 03:50:41,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 03:50:41,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 03:50:41,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 03:50:41,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 03:50:41,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 03:50:41,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 03:50:41,583 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 03:50:41,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 03:50:41,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 03:50:41,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 03:50:41,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 03:50:41,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 03:50:41,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 03:50:41,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 03:50:41,584 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 03:50:41,584 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 03:50:41,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 03:50:41,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 03:50:41,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 03:50:41,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 03:50:41,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 03:50:41,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 03:50:41,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 03:50:41,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:50:41,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 03:50:41,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 03:50:41,585 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 03:50:41,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 03:50:41,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 03:50:41,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 03:50:41,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 03:50:41,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 03:50:41,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 03:50:41,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 03:50:41,586 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 -> aa3605b34b0253b1f3c1c66572f8bf88a65afb1f8dcc06ae4ec10c63433c4213 [2025-03-09 03:50:41,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 03:50:41,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 03:50:41,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 03:50:41,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 03:50:41,796 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 03:50:41,797 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_square_08_bad.i [2025-03-09 03:50:42,961 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e52cff6a6/9ecca57908cd41b8aff06b115555bef4/FLAGdd738ebbb [2025-03-09 03:50:43,351 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 03:50:43,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_square_08_bad.i [2025-03-09 03:50:43,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e52cff6a6/9ecca57908cd41b8aff06b115555bef4/FLAGdd738ebbb [2025-03-09 03:50:43,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e52cff6a6/9ecca57908cd41b8aff06b115555bef4 [2025-03-09 03:50:43,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 03:50:43,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 03:50:43,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 03:50:43,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 03:50:43,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 03:50:43,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:50:43" (1/1) ... [2025-03-09 03:50:43,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec0188c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:43, skipping insertion in model container [2025-03-09 03:50:43,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:50:43" (1/1) ... [2025-03-09 03:50:43,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 03:50:44,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:50:44,327 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 03:50:44,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:50:44,559 INFO L204 MainTranslator]: Completed translation [2025-03-09 03:50:44,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44 WrapperNode [2025-03-09 03:50:44,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 03:50:44,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 03:50:44,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 03:50:44,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 03:50:44,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44" (1/1) ... [2025-03-09 03:50:44,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44" (1/1) ... [2025-03-09 03:50:44,600 INFO L138 Inliner]: procedures = 938, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2025-03-09 03:50:44,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 03:50:44,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 03:50:44,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 03:50:44,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 03:50:44,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44" (1/1) ... [2025-03-09 03:50:44,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44" (1/1) ... [2025-03-09 03:50:44,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44" (1/1) ... [2025-03-09 03:50:44,629 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-09 03:50:44,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44" (1/1) ... [2025-03-09 03:50:44,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44" (1/1) ... [2025-03-09 03:50:44,635 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44" (1/1) ... [2025-03-09 03:50:44,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44" (1/1) ... [2025-03-09 03:50:44,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44" (1/1) ... [2025-03-09 03:50:44,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44" (1/1) ... [2025-03-09 03:50:44,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 03:50:44,647 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 03:50:44,647 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 03:50:44,647 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 03:50:44,648 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44" (1/1) ... [2025-03-09 03:50:44,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:50:44,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:50:44,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 03:50:44,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 03:50:44,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 03:50:44,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 03:50:44,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 03:50:44,687 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2025-03-09 03:50:44,687 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2025-03-09 03:50:44,687 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 03:50:44,687 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 03:50:44,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 03:50:44,775 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 03:50:44,776 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 03:50:44,861 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-09 03:50:44,861 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 03:50:44,867 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 03:50:44,867 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 03:50:44,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:50:44 BoogieIcfgContainer [2025-03-09 03:50:44,868 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 03:50:44,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 03:50:44,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 03:50:44,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 03:50:44,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:50:43" (1/3) ... [2025-03-09 03:50:44,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cadf2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:50:44, skipping insertion in model container [2025-03-09 03:50:44,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:44" (2/3) ... [2025-03-09 03:50:44,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cadf2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:50:44, skipping insertion in model container [2025-03-09 03:50:44,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:50:44" (3/3) ... [2025-03-09 03:50:44,875 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_square_08_bad.i [2025-03-09 03:50:44,886 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 03:50:44,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_square_08_bad.i that has 3 procedures, 31 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 03:50:44,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 03:50:44,928 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;@558bdf58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 03:50:44,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-09 03:50:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 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-09 03:50:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 03:50:44,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:50:44,934 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:50:44,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:50:44,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:50:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash -795327260, now seen corresponding path program 1 times [2025-03-09 03:50:44,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:50:44,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826618353] [2025-03-09 03:50:44,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:50:44,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:50:45,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 03:50:45,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 03:50:45,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:45,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:50:45,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-09 03:50:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:50:45,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826618353] [2025-03-09 03:50:45,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826618353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:50:45,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:50:45,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 03:50:45,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106512644] [2025-03-09 03:50:45,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:50:45,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 03:50:45,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:50:45,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 03:50:45,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 03:50:45,097 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 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) Second operand has 2 states, 1 states have (on average 13.0) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 03:50:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:50:45,109 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-03-09 03:50:45,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 03:50:45,111 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 13.0) internal successors, (13), 2 states have internal predecessors, (13), 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 21 [2025-03-09 03:50:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:50:45,116 INFO L225 Difference]: With dead ends: 31 [2025-03-09 03:50:45,116 INFO L226 Difference]: Without dead ends: 23 [2025-03-09 03:50:45,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 03:50:45,122 INFO L435 NwaCegarLoop]: 36 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, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:50:45,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:50:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-09 03:50:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-09 03:50:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 03:50:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-09 03:50:45,153 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 21 [2025-03-09 03:50:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:50:45,155 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-09 03:50:45,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 13.0) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 03:50:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-09 03:50:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 03:50:45,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:50:45,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:50:45,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 03:50:45,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:50:45,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:50:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1114658696, now seen corresponding path program 1 times [2025-03-09 03:50:45,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:50:45,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110712658] [2025-03-09 03:50:45,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:50:45,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:50:45,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 03:50:45,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 03:50:45,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:45,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:50:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 03:50:45,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:50:45,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110712658] [2025-03-09 03:50:45,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110712658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 03:50:45,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596538495] [2025-03-09 03:50:45,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:50:45,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:50:45,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:50:45,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:50:45,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 03:50:45,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 03:50:45,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 03:50:45,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:45,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:50:45,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 03:50:45,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 03:50:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:50:45,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 03:50:45,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596538495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:50:45,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 03:50:45,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 03:50:45,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10209435] [2025-03-09 03:50:45,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:50:45,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 03:50:45,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:50:45,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 03:50:45,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 03:50:45,414 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 03:50:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:50:45,425 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2025-03-09 03:50:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 03:50:45,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-09 03:50:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:50:45,426 INFO L225 Difference]: With dead ends: 32 [2025-03-09 03:50:45,427 INFO L226 Difference]: Without dead ends: 23 [2025-03-09 03:50:45,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 03:50:45,427 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:50:45,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:50:45,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-09 03:50:45,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-09 03:50:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 03:50:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-09 03:50:45,433 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 22 [2025-03-09 03:50:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:50:45,433 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-09 03:50:45,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 03:50:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-09 03:50:45,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 03:50:45,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:50:45,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:50:45,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 03:50:45,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:50:45,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:50:45,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:50:45,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1382873446, now seen corresponding path program 1 times [2025-03-09 03:50:45,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:50:45,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432212703] [2025-03-09 03:50:45,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:50:45,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:50:45,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 03:50:45,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 03:50:45,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:45,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 03:50:45,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [489229657] [2025-03-09 03:50:45,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:50:45,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:50:45,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:50:45,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:50:45,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 03:50:45,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 03:50:45,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 03:50:45,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:45,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:50:45,750 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 03:50:45,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 03:50:45,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 03:50:45,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:45,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:50:45,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 03:50:45,791 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 03:50:45,791 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-03-09 03:50:45,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-03-09 03:50:45,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 03:50:45,993 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,SelfDestructingSolverStorable2 [2025-03-09 03:50:45,996 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 03:50:46,019 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 03:50:46,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:50:46 BoogieIcfgContainer [2025-03-09 03:50:46,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 03:50:46,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 03:50:46,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 03:50:46,021 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 03:50:46,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:50:44" (3/4) ... [2025-03-09 03:50:46,023 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 03:50:46,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 03:50:46,024 INFO L158 Benchmark]: Toolchain (without parser) took 2628.36ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 78.4MB in the end (delta: 22.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2025-03-09 03:50:46,024 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:46,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1163.68ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 94.9MB in the end (delta: 5.5MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2025-03-09 03:50:46,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.35ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 91.6MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 03:50:46,025 INFO L158 Benchmark]: Boogie Preprocessor took 45.35ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:46,025 INFO L158 Benchmark]: IcfgBuilder took 220.43ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 77.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 03:50:46,025 INFO L158 Benchmark]: TraceAbstraction took 1150.80ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 78.4MB in the end (delta: -1.5MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2025-03-09 03:50:46,025 INFO L158 Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 78.4MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:46,026 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1163.68ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 94.9MB in the end (delta: 5.5MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.35ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 91.6MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.35ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 220.43ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 77.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1150.80ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 78.4MB in the end (delta: -1.5MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * Witness Printer took 2.26ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 78.4MB in the end (delta: 21.0kB). 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: 1861]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1850, overapproximation of fgets at line 1848. 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] [L1869] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1869] 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] [L1870] CALL CWE190_Integer_Overflow__int_fgets_square_08_bad() [L1842] int data; [L1843] 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] [L1844] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1834] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1844] RET staticReturnsTrue() 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] [L1844] COND TRUE staticReturnsTrue() [L1847] 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] [L1848] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1850] data = atoi(inputBuffer) [L1858] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1834] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1858] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-46341, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1858] COND TRUE staticReturnsTrue() [L1861] data * 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: 1861]: 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 3 procedures, 31 locations, 42 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 60 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 78 SizeOfPredicates, 0 NumberOfNonLiveVariables, 91 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 7/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-09 03:50:46,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_square_08_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 aa3605b34b0253b1f3c1c66572f8bf88a65afb1f8dcc06ae4ec10c63433c4213 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 03:50:47,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 03:50:47,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-03-09 03:50:47,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 03:50:47,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 03:50:47,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-03-09 03:50:47,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 03:50:47,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 03:50:47,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 03:50:47,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 03:50:47,998 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 03:50:47,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 03:50:47,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 03:50:47,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 03:50:47,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 03:50:47,999 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 03:50:47,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 03:50:47,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 03:50:47,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 03:50:47,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 03:50:47,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 03:50:47,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 03:50:47,999 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 03:50:47,999 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 03:50:48,000 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 03:50:48,000 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 03:50:48,000 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 03:50:48,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 03:50:48,000 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 03:50:48,000 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 03:50:48,000 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 03:50:48,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 03:50:48,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 03:50:48,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 03:50:48,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:50:48,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 03:50:48,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 03:50:48,001 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 03:50:48,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 03:50:48,001 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 03:50:48,001 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 03:50:48,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 03:50:48,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 03:50:48,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 03:50:48,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 03:50:48,002 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 -> aa3605b34b0253b1f3c1c66572f8bf88a65afb1f8dcc06ae4ec10c63433c4213 [2025-03-09 03:50:48,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 03:50:48,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 03:50:48,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 03:50:48,221 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 03:50:48,221 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 03:50:48,222 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_square_08_bad.i [2025-03-09 03:50:49,381 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3a7560f/63501dc49ece49a19ade861c35986992/FLAGd5ecc243d [2025-03-09 03:50:49,725 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 03:50:49,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_square_08_bad.i [2025-03-09 03:50:49,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3a7560f/63501dc49ece49a19ade861c35986992/FLAGd5ecc243d [2025-03-09 03:50:49,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3a7560f/63501dc49ece49a19ade861c35986992 [2025-03-09 03:50:49,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 03:50:49,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 03:50:49,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 03:50:49,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 03:50:49,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 03:50:49,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:50:49" (1/1) ... [2025-03-09 03:50:49,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63dbc800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:49, skipping insertion in model container [2025-03-09 03:50:49,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:50:49" (1/1) ... [2025-03-09 03:50:49,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 03:50:50,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:50:50,621 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 03:50:50,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:50:50,927 INFO L204 MainTranslator]: Completed translation [2025-03-09 03:50:50,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50 WrapperNode [2025-03-09 03:50:50,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 03:50:50,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 03:50:50,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 03:50:50,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 03:50:50,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50" (1/1) ... [2025-03-09 03:50:50,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50" (1/1) ... [2025-03-09 03:50:50,969 INFO L138 Inliner]: procedures = 943, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-03-09 03:50:50,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 03:50:50,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 03:50:50,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 03:50:50,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 03:50:50,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50" (1/1) ... [2025-03-09 03:50:50,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50" (1/1) ... [2025-03-09 03:50:50,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50" (1/1) ... [2025-03-09 03:50:50,990 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-09 03:50:50,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50" (1/1) ... [2025-03-09 03:50:50,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50" (1/1) ... [2025-03-09 03:50:50,995 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50" (1/1) ... [2025-03-09 03:50:50,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50" (1/1) ... [2025-03-09 03:50:50,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50" (1/1) ... [2025-03-09 03:50:50,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50" (1/1) ... [2025-03-09 03:50:51,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 03:50:51,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 03:50:51,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 03:50:51,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 03:50:51,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50" (1/1) ... [2025-03-09 03:50:51,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:50:51,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:50:51,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 03:50:51,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 03:50:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 03:50:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 03:50:51,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 03:50:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2025-03-09 03:50:51,048 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2025-03-09 03:50:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 03:50:51,048 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 03:50:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 03:50:51,169 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 03:50:51,170 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 03:50:52,272 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-09 03:50:52,272 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 03:50:52,280 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 03:50:52,280 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 03:50:52,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:50:52 BoogieIcfgContainer [2025-03-09 03:50:52,280 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 03:50:52,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 03:50:52,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 03:50:52,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 03:50:52,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:50:49" (1/3) ... [2025-03-09 03:50:52,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db12006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:50:52, skipping insertion in model container [2025-03-09 03:50:52,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:50" (2/3) ... [2025-03-09 03:50:52,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db12006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:50:52, skipping insertion in model container [2025-03-09 03:50:52,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:50:52" (3/3) ... [2025-03-09 03:50:52,292 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_square_08_bad.i [2025-03-09 03:50:52,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 03:50:52,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_square_08_bad.i that has 3 procedures, 29 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 03:50:52,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 03:50:52,350 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;@4085684, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 03:50:52,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-09 03:50:52,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 22 states have internal predecessors, (25), 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-09 03:50:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 03:50:52,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:50:52,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:50:52,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:50:52,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:50:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash 29012103, now seen corresponding path program 1 times [2025-03-09 03:50:52,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 03:50:52,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354724075] [2025-03-09 03:50:52,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:50:52,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:50:52,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:50:52,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:50:52,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 03:50:52,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 03:50:52,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 03:50:52,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:52,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:50:52,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 03:50:52,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 03:50:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:50:52,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 03:50:52,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 03:50:52,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354724075] [2025-03-09 03:50:52,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354724075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:50:52,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:50:52,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 03:50:52,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358573842] [2025-03-09 03:50:52,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:50:52,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 03:50:52,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 03:50:52,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 03:50:52,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 03:50:52,599 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 22 states have internal predecessors, (25), 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) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 03:50:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:50:52,635 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-03-09 03:50:52,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 03:50:52,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2025-03-09 03:50:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:50:52,642 INFO L225 Difference]: With dead ends: 49 [2025-03-09 03:50:52,642 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 03:50:52,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-09 03:50:52,648 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:50:52,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:50:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 03:50:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-09 03:50:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 03:50:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-09 03:50:52,677 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2025-03-09 03:50:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:50:52,678 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-09 03:50:52,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 03:50:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-09 03:50:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 03:50:52,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:50:52,679 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:50:52,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 03:50:52,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:50:52,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:50:52,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:50:52,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1567587973, now seen corresponding path program 1 times [2025-03-09 03:50:52,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 03:50:52,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087558182] [2025-03-09 03:50:52,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:50:52,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:50:52,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:50:52,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:50:52,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 03:50:52,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 03:50:54,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 03:50:54,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:54,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:50:54,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 03:50:54,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 03:50:56,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 03:50:56,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:56,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:50:56,063 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 03:50:56,063 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 03:50:56,064 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-03-09 03:50:56,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-03-09 03:50:56,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 03:50:56,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:50:56,271 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 03:50:56,289 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 03:50:56,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:50:56 BoogieIcfgContainer [2025-03-09 03:50:56,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 03:50:56,291 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 03:50:56,291 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 03:50:56,293 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 03:50:56,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:50:52" (3/4) ... [2025-03-09 03:50:56,295 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 03:50:56,295 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 03:50:56,296 INFO L158 Benchmark]: Toolchain (without parser) took 6524.38ms. Allocated memory is still 117.4MB. Free memory was 87.4MB in the beginning and 73.8MB in the end (delta: 13.5MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2025-03-09 03:50:56,296 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:56,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1155.40ms. Allocated memory is still 117.4MB. Free memory was 87.1MB in the beginning and 79.3MB in the end (delta: 7.8MB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. [2025-03-09 03:50:56,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.65ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 75.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:56,298 INFO L158 Benchmark]: Boogie Preprocessor took 30.09ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 03:50:56,300 INFO L158 Benchmark]: IcfgBuilder took 1279.41ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 60.1MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 03:50:56,300 INFO L158 Benchmark]: TraceAbstraction took 4008.16ms. Allocated memory is still 117.4MB. Free memory was 59.4MB in the beginning and 74.7MB in the end (delta: -15.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:56,300 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 73.8MB in the end (delta: 895.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:56,301 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.13ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1155.40ms. Allocated memory is still 117.4MB. Free memory was 87.1MB in the beginning and 79.3MB in the end (delta: 7.8MB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.65ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 75.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.09ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1279.41ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 60.1MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4008.16ms. Allocated memory is still 117.4MB. Free memory was 59.4MB in the beginning and 74.7MB in the end (delta: -15.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 73.8MB in the end (delta: 895.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: 1861]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1850, overapproximation of fgets at line 1848. 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] [L1869] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1869] 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] [L1870] CALL CWE190_Integer_Overflow__int_fgets_square_08_bad() [L1842] int data; [L1843] 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] [L1844] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1834] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1844] RET staticReturnsTrue() 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] [L1844] COND TRUE staticReturnsTrue() [L1847] 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] [L1848] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1850] data = atoi(inputBuffer) [L1858] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1834] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1858] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1858] COND TRUE staticReturnsTrue() [L1861] data * 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: 1861]: 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 3 procedures, 29 locations, 40 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 33 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 4, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 24 SizeOfPredicates, 0 NumberOfNonLiveVariables, 52 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 03:50:56,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample