./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_16_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_16_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 2098b126dd7de75eecbf2e4743a2e50bd5d2b8da3ec049db3bbe67b9738f4707 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 20:28:19,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 20:28:19,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-10 20:28:19,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 20:28:19,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 20:28:20,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 20:28:20,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 20:28:20,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 20:28:20,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 20:28:20,038 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 20:28:20,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 20:28:20,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 20:28:20,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 20:28:20,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 20:28:20,042 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 20:28:20,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 20:28:20,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 20:28:20,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 20:28:20,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 20:28:20,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 20:28:20,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 20:28:20,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 20:28:20,049 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 20:28:20,049 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 20:28:20,049 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 20:28:20,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 20:28:20,050 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 20:28:20,050 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 20:28:20,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 20:28:20,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 20:28:20,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 20:28:20,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:28:20,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 20:28:20,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 20:28:20,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 20:28:20,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 20:28:20,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 20:28:20,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 20:28:20,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 20:28:20,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 20:28:20,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 20:28:20,053 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 2098b126dd7de75eecbf2e4743a2e50bd5d2b8da3ec049db3bbe67b9738f4707 [2024-11-10 20:28:20,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 20:28:20,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 20:28:20,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 20:28:20,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 20:28:20,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 20:28:20,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_16_bad.i [2024-11-10 20:28:21,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 20:28:22,070 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 20:28:22,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_16_bad.i [2024-11-10 20:28:22,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7487ef6/ce16d77f78ba45d28085039aa034ecd7/FLAG4498c0fba [2024-11-10 20:28:22,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7487ef6/ce16d77f78ba45d28085039aa034ecd7 [2024-11-10 20:28:22,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 20:28:22,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 20:28:22,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 20:28:22,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 20:28:22,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 20:28:22,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:28:22" (1/1) ... [2024-11-10 20:28:22,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7073ee35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:22, skipping insertion in model container [2024-11-10 20:28:22,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:28:22" (1/1) ... [2024-11-10 20:28:22,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 20:28:23,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:28:23,144 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 20:28:23,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:28:23,383 INFO L204 MainTranslator]: Completed translation [2024-11-10 20:28:23,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23 WrapperNode [2024-11-10 20:28:23,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 20:28:23,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 20:28:23,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 20:28:23,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 20:28:23,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23" (1/1) ... [2024-11-10 20:28:23,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23" (1/1) ... [2024-11-10 20:28:23,454 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2024-11-10 20:28:23,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 20:28:23,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 20:28:23,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 20:28:23,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 20:28:23,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23" (1/1) ... [2024-11-10 20:28:23,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23" (1/1) ... [2024-11-10 20:28:23,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23" (1/1) ... [2024-11-10 20:28:23,505 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]. [2024-11-10 20:28:23,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23" (1/1) ... [2024-11-10 20:28:23,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23" (1/1) ... [2024-11-10 20:28:23,516 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23" (1/1) ... [2024-11-10 20:28:23,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23" (1/1) ... [2024-11-10 20:28:23,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23" (1/1) ... [2024-11-10 20:28:23,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23" (1/1) ... [2024-11-10 20:28:23,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 20:28:23,525 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 20:28:23,525 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 20:28:23,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 20:28:23,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23" (1/1) ... [2024-11-10 20:28:23,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:28:23,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 20:28:23,574 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) [2024-11-10 20:28:23,580 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 [2024-11-10 20:28:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 20:28:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 20:28:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 20:28:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 20:28:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 20:28:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 20:28:23,746 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 20:28:23,748 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 20:28:23,872 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-10 20:28:23,872 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 20:28:23,884 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 20:28:23,884 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 20:28:23,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:28:23 BoogieIcfgContainer [2024-11-10 20:28:23,885 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 20:28:23,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 20:28:23,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 20:28:23,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 20:28:23,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:28:22" (1/3) ... [2024-11-10 20:28:23,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4bd0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:28:23, skipping insertion in model container [2024-11-10 20:28:23,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:23" (2/3) ... [2024-11-10 20:28:23,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4bd0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:28:23, skipping insertion in model container [2024-11-10 20:28:23,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:28:23" (3/3) ... [2024-11-10 20:28:23,900 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_16_bad.i [2024-11-10 20:28:23,914 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 20:28:23,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 20:28:23,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 20:28:23,964 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;@5ab9a36d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 20:28:23,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 20:28:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 20:28:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 20:28:23,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:28:23,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:28:23,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:28:23,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:28:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash -223876830, now seen corresponding path program 1 times [2024-11-10 20:28:23,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:28:23,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230662935] [2024-11-10 20:28:23,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:28:23,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:28:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:28:24,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 20:28:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:28:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:28:24,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 20:28:24,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230662935] [2024-11-10 20:28:24,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230662935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:28:24,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:28:24,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:28:24,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250583512] [2024-11-10 20:28:24,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:28:24,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 20:28:24,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 20:28:24,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 20:28:24,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 20:28:24,238 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:28:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:28:24,252 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-10 20:28:24,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 20:28:24,253 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-10 20:28:24,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:28:24,260 INFO L225 Difference]: With dead ends: 46 [2024-11-10 20:28:24,260 INFO L226 Difference]: Without dead ends: 20 [2024-11-10 20:28:24,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 20:28:24,264 INFO L432 NwaCegarLoop]: 31 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, 31 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 [2024-11-10 20:28:24,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:28:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-10 20:28:24,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-10 20:28:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 20:28:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-10 20:28:24,293 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2024-11-10 20:28:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:28:24,294 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-10 20:28:24,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:28:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-10 20:28:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 20:28:24,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:28:24,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:28:24,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 20:28:24,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:28:24,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:28:24,297 INFO L85 PathProgramCache]: Analyzing trace with hash -27722561, now seen corresponding path program 1 times [2024-11-10 20:28:24,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:28:24,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370489718] [2024-11-10 20:28:24,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:28:24,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:28:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:28:24,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 20:28:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:28:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:28:24,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 20:28:24,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370489718] [2024-11-10 20:28:24,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370489718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:28:24,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:28:24,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 20:28:24,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740956803] [2024-11-10 20:28:24,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:28:24,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 20:28:24,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 20:28:24,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 20:28:24,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 20:28:24,547 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:28:24,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:28:24,565 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-10 20:28:24,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 20:28:24,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-10 20:28:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:28:24,567 INFO L225 Difference]: With dead ends: 20 [2024-11-10 20:28:24,567 INFO L226 Difference]: Without dead ends: 19 [2024-11-10 20:28:24,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 20:28:24,570 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:28:24,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:28:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-10 20:28:24,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-10 20:28:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 20:28:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-10 20:28:24,575 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2024-11-10 20:28:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:28:24,576 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-10 20:28:24,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:28:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-10 20:28:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 20:28:24,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:28:24,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:28:24,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 20:28:24,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:28:24,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:28:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash -859399410, now seen corresponding path program 1 times [2024-11-10 20:28:24,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:28:24,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474528058] [2024-11-10 20:28:24,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:28:24,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:28:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:28:24,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 20:28:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:28:24,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 20:28:24,666 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 20:28:24,667 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 20:28:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 20:28:24,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 20:28:24,673 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 20:28:24,701 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 20:28:24,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:28:24 BoogieIcfgContainer [2024-11-10 20:28:24,709 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 20:28:24,710 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 20:28:24,710 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 20:28:24,710 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 20:28:24,711 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:28:23" (3/4) ... [2024-11-10 20:28:24,714 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 20:28:24,715 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 20:28:24,716 INFO L158 Benchmark]: Toolchain (without parser) took 2373.06ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 120.9MB in the beginning and 162.0MB in the end (delta: -41.1MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-11-10 20:28:24,717 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:28:24,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1039.66ms. Allocated memory is still 184.5MB. Free memory was 120.9MB in the beginning and 55.0MB in the end (delta: 65.9MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-11-10 20:28:24,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.02ms. Allocated memory is still 184.5MB. Free memory was 55.0MB in the beginning and 52.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:28:24,719 INFO L158 Benchmark]: Boogie Preprocessor took 68.92ms. Allocated memory is still 184.5MB. Free memory was 52.1MB in the beginning and 150.4MB in the end (delta: -98.3MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-11-10 20:28:24,719 INFO L158 Benchmark]: IcfgBuilder took 359.87ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 150.4MB in the beginning and 210.2MB in the end (delta: -59.8MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-11-10 20:28:24,720 INFO L158 Benchmark]: TraceAbstraction took 821.61ms. Allocated memory is still 255.9MB. Free memory was 209.1MB in the beginning and 163.0MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-10 20:28:24,720 INFO L158 Benchmark]: Witness Printer took 5.35ms. Allocated memory is still 255.9MB. Free memory was 163.0MB in the beginning and 162.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:28:24,722 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 184.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1039.66ms. Allocated memory is still 184.5MB. Free memory was 120.9MB in the beginning and 55.0MB in the end (delta: 65.9MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.02ms. Allocated memory is still 184.5MB. Free memory was 55.0MB in the beginning and 52.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.92ms. Allocated memory is still 184.5MB. Free memory was 52.1MB in the beginning and 150.4MB in the end (delta: -98.3MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * IcfgBuilder took 359.87ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 150.4MB in the beginning and 210.2MB in the end (delta: -59.8MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 821.61ms. Allocated memory is still 255.9MB. Free memory was 209.1MB in the beginning and 163.0MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Witness Printer took 5.35ms. Allocated memory is still 255.9MB. Free memory was 163.0MB in the beginning and 162.0MB in the end (delta: 1.0MB). 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: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1580, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1580] 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) [L1580] 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] [L1581] CALL CWE190_Integer_Overflow__int_fgets_postinc_16_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE 1 [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1567] COND TRUE 1 [L1570] 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: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 49 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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.3s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 41 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 20:28:24,755 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/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_16_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 2098b126dd7de75eecbf2e4743a2e50bd5d2b8da3ec049db3bbe67b9738f4707 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 20:28:27,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 20:28:27,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-10 20:28:27,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 20:28:27,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 20:28:27,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-10 20:28:27,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 20:28:27,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 20:28:27,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 20:28:27,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 20:28:27,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 20:28:27,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 20:28:27,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 20:28:27,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 20:28:27,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 20:28:27,143 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 20:28:27,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 20:28:27,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 20:28:27,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 20:28:27,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 20:28:27,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 20:28:27,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 20:28:27,145 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 20:28:27,145 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 20:28:27,145 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 20:28:27,146 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 20:28:27,146 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 20:28:27,146 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 20:28:27,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 20:28:27,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 20:28:27,147 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 20:28:27,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 20:28:27,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 20:28:27,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 20:28:27,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:28:27,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 20:28:27,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 20:28:27,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 20:28:27,150 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 20:28:27,150 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 20:28:27,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 20:28:27,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 20:28:27,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 20:28:27,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 20:28:27,152 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 2098b126dd7de75eecbf2e4743a2e50bd5d2b8da3ec049db3bbe67b9738f4707 [2024-11-10 20:28:27,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 20:28:27,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 20:28:27,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 20:28:27,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 20:28:27,508 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 20:28:27,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_16_bad.i [2024-11-10 20:28:29,075 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 20:28:29,427 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 20:28:29,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_16_bad.i [2024-11-10 20:28:29,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc661b72/6c996f91f6c042548029de62fb5eebbe/FLAG98375434d [2024-11-10 20:28:29,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc661b72/6c996f91f6c042548029de62fb5eebbe [2024-11-10 20:28:29,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 20:28:29,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 20:28:29,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 20:28:29,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 20:28:29,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 20:28:29,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:28:29" (1/1) ... [2024-11-10 20:28:29,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae55238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:29, skipping insertion in model container [2024-11-10 20:28:29,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:28:29" (1/1) ... [2024-11-10 20:28:29,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 20:28:30,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:28:30,587 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 20:28:30,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:28:30,782 INFO L204 MainTranslator]: Completed translation [2024-11-10 20:28:30,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30 WrapperNode [2024-11-10 20:28:30,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 20:28:30,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 20:28:30,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 20:28:30,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 20:28:30,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30" (1/1) ... [2024-11-10 20:28:30,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30" (1/1) ... [2024-11-10 20:28:30,845 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-11-10 20:28:30,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 20:28:30,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 20:28:30,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 20:28:30,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 20:28:30,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30" (1/1) ... [2024-11-10 20:28:30,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30" (1/1) ... [2024-11-10 20:28:30,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30" (1/1) ... [2024-11-10 20:28:30,874 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]. [2024-11-10 20:28:30,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30" (1/1) ... [2024-11-10 20:28:30,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30" (1/1) ... [2024-11-10 20:28:30,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30" (1/1) ... [2024-11-10 20:28:30,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30" (1/1) ... [2024-11-10 20:28:30,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30" (1/1) ... [2024-11-10 20:28:30,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30" (1/1) ... [2024-11-10 20:28:30,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 20:28:30,893 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 20:28:30,894 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 20:28:30,894 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 20:28:30,895 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30" (1/1) ... [2024-11-10 20:28:30,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:28:30,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 20:28:30,923 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) [2024-11-10 20:28:30,925 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 [2024-11-10 20:28:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 20:28:30,967 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 20:28:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 20:28:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 20:28:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 20:28:30,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 20:28:31,108 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 20:28:31,110 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 20:28:31,266 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 20:28:31,266 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 20:28:31,280 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 20:28:31,280 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 20:28:31,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:28:31 BoogieIcfgContainer [2024-11-10 20:28:31,281 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 20:28:31,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 20:28:31,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 20:28:31,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 20:28:31,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:28:29" (1/3) ... [2024-11-10 20:28:31,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a22238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:28:31, skipping insertion in model container [2024-11-10 20:28:31,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:30" (2/3) ... [2024-11-10 20:28:31,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a22238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:28:31, skipping insertion in model container [2024-11-10 20:28:31,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:28:31" (3/3) ... [2024-11-10 20:28:31,290 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_16_bad.i [2024-11-10 20:28:31,324 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 20:28:31,324 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 20:28:31,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 20:28:31,396 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;@23071341, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 20:28:31,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 20:28:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 20:28:31,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 20:28:31,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:28:31,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:28:31,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:28:31,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:28:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash -223876830, now seen corresponding path program 1 times [2024-11-10 20:28:31,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:28:31,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975015343] [2024-11-10 20:28:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:28:31,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:28:31,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:28:31,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 20:28:31,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 20:28:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:28:31,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 20:28:31,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 20:28:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:28:31,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 20:28:31,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 20:28:31,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975015343] [2024-11-10 20:28:31,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975015343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:28:31,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:28:31,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:28:31,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916520791] [2024-11-10 20:28:31,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:28:31,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 20:28:31,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 20:28:31,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 20:28:31,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 20:28:31,580 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:28:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:28:31,596 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2024-11-10 20:28:31,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 20:28:31,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-10 20:28:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:28:31,605 INFO L225 Difference]: With dead ends: 45 [2024-11-10 20:28:31,606 INFO L226 Difference]: Without dead ends: 19 [2024-11-10 20:28:31,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 20:28:31,612 INFO L432 NwaCegarLoop]: 30 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, 30 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 [2024-11-10 20:28:31,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:28:31,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-10 20:28:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-10 20:28:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 20:28:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-10 20:28:31,643 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2024-11-10 20:28:31,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:28:31,646 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-10 20:28:31,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:28:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-10 20:28:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 20:28:31,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:28:31,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:28:31,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 20:28:31,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:28:31,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:28:31,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:28:31,850 INFO L85 PathProgramCache]: Analyzing trace with hash -859399410, now seen corresponding path program 1 times [2024-11-10 20:28:31,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:28:31,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420833773] [2024-11-10 20:28:31,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:28:31,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:28:31,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:28:31,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 20:28:31,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 20:28:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:28:32,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 20:28:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:28:32,165 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 20:28:32,166 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 20:28:32,167 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 20:28:32,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 20:28:32,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 20:28:32,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:28:32,377 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 20:28:32,396 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 20:28:32,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:28:32 BoogieIcfgContainer [2024-11-10 20:28:32,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 20:28:32,400 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 20:28:32,400 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 20:28:32,401 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 20:28:32,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:28:31" (3/4) ... [2024-11-10 20:28:32,403 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 20:28:32,404 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 20:28:32,405 INFO L158 Benchmark]: Toolchain (without parser) took 2739.20ms. Allocated memory was 60.8MB in the beginning and 94.4MB in the end (delta: 33.6MB). Free memory was 33.4MB in the beginning and 57.3MB in the end (delta: -23.9MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-11-10 20:28:32,405 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 44.0MB. Free memory was 24.4MB in the beginning and 24.4MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:28:32,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1116.69ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 33.2MB in the beginning and 29.4MB in the end (delta: 3.8MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2024-11-10 20:28:32,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.40ms. Allocated memory is still 75.5MB. Free memory was 29.0MB in the beginning and 46.6MB in the end (delta: -17.6MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-10 20:28:32,407 INFO L158 Benchmark]: Boogie Preprocessor took 45.09ms. Allocated memory is still 75.5MB. Free memory was 46.2MB in the beginning and 43.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:28:32,407 INFO L158 Benchmark]: IcfgBuilder took 387.30ms. Allocated memory is still 75.5MB. Free memory was 43.7MB in the beginning and 29.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 20:28:32,408 INFO L158 Benchmark]: TraceAbstraction took 1116.81ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 28.3MB in the beginning and 57.7MB in the end (delta: -29.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:28:32,408 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 94.4MB. Free memory was 57.7MB in the beginning and 57.3MB in the end (delta: 389.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:28:32,413 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.93ms. Allocated memory is still 44.0MB. Free memory was 24.4MB in the beginning and 24.4MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1116.69ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 33.2MB in the beginning and 29.4MB in the end (delta: 3.8MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.40ms. Allocated memory is still 75.5MB. Free memory was 29.0MB in the beginning and 46.6MB in the end (delta: -17.6MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.09ms. Allocated memory is still 75.5MB. Free memory was 46.2MB in the beginning and 43.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 387.30ms. Allocated memory is still 75.5MB. Free memory was 43.7MB in the beginning and 29.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1116.81ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 28.3MB in the beginning and 57.7MB in the end (delta: -29.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 94.4MB. Free memory was 57.7MB in the beginning and 57.3MB in the end (delta: 389.7kB). 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: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1580, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1580] 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) [L1580] 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] [L1581] CALL CWE190_Integer_Overflow__int_fgets_postinc_16_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE 1 [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1567] COND TRUE 1 [L1570] 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: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, 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, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 30 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 0 NumberOfNonLiveVariables, 43 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 20:28:32,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample