./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 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_preinc_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b91dae833bbe914f6db858614925f2e5ed6a0d4828d26d06ca221fba91b27025 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 20:29:18,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 20:29:18,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-10 20:29:18,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 20:29:18,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 20:29:18,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 20:29:18,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 20:29:18,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 20:29:18,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 20:29:18,753 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 20:29:18,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 20:29:18,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 20:29:18,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 20:29:18,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 20:29:18,757 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 20:29:18,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 20:29:18,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 20:29:18,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 20:29:18,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 20:29:18,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 20:29:18,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 20:29:18,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 20:29:18,760 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 20:29:18,760 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 20:29:18,761 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 20:29:18,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 20:29:18,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 20:29:18,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 20:29:18,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 20:29:18,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 20:29:18,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 20:29:18,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:29:18,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 20:29:18,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 20:29:18,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 20:29:18,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 20:29:18,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 20:29:18,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 20:29:18,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 20:29:18,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 20:29:18,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 20:29:18,766 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 -> b91dae833bbe914f6db858614925f2e5ed6a0d4828d26d06ca221fba91b27025 [2024-11-10 20:29:19,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 20:29:19,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 20:29:19,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 20:29:19,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 20:29:19,043 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 20:29:19,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2024-11-10 20:29:20,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 20:29:20,851 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 20:29:20,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2024-11-10 20:29:20,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7469fd4/62dc875f07fb40328bec93cb98814b7c/FLAGef43c71dd [2024-11-10 20:29:21,072 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7469fd4/62dc875f07fb40328bec93cb98814b7c [2024-11-10 20:29:21,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 20:29:21,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 20:29:21,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 20:29:21,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 20:29:21,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 20:29:21,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:29:21" (1/1) ... [2024-11-10 20:29:21,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6cc950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:21, skipping insertion in model container [2024-11-10 20:29:21,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:29:21" (1/1) ... [2024-11-10 20:29:21,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 20:29:21,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:29:21,928 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 20:29:22,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:29:22,128 INFO L204 MainTranslator]: Completed translation [2024-11-10 20:29:22,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:22 WrapperNode [2024-11-10 20:29:22,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 20:29:22,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 20:29:22,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 20:29:22,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 20:29:22,137 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:29:22" (1/1) ... [2024-11-10 20:29:22,169 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:29:22" (1/1) ... [2024-11-10 20:29:22,197 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-11-10 20:29:22,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 20:29:22,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 20:29:22,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 20:29:22,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 20:29:22,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:22" (1/1) ... [2024-11-10 20:29:22,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:22" (1/1) ... [2024-11-10 20:29:22,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:22" (1/1) ... [2024-11-10 20:29:22,227 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:29:22,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:22" (1/1) ... [2024-11-10 20:29:22,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:22" (1/1) ... [2024-11-10 20:29:22,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:22" (1/1) ... [2024-11-10 20:29:22,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:22" (1/1) ... [2024-11-10 20:29:22,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:22" (1/1) ... [2024-11-10 20:29:22,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:22" (1/1) ... [2024-11-10 20:29:22,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 20:29:22,245 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 20:29:22,245 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 20:29:22,245 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 20:29:22,246 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:22" (1/1) ... [2024-11-10 20:29:22,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:29:22,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 20:29:22,281 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:29:22,285 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:29:22,326 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-10 20:29:22,327 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-10 20:29:22,327 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-10 20:29:22,327 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-10 20:29:22,327 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 20:29:22,327 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 20:29:22,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 20:29:22,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 20:29:22,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 20:29:22,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 20:29:22,471 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 20:29:22,474 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 20:29:22,511 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520: havoc #t~nondet87; [2024-11-10 20:29:22,613 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 20:29:22,613 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 20:29:22,631 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 20:29:22,632 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 20:29:22,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:29:22 BoogieIcfgContainer [2024-11-10 20:29:22,633 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 20:29:22,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 20:29:22,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 20:29:22,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 20:29:22,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:29:21" (1/3) ... [2024-11-10 20:29:22,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660ce1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:29:22, skipping insertion in model container [2024-11-10 20:29:22,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:22" (2/3) ... [2024-11-10 20:29:22,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660ce1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:29:22, skipping insertion in model container [2024-11-10 20:29:22,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:29:22" (3/3) ... [2024-11-10 20:29:22,643 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2024-11-10 20:29:22,660 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 20:29:22,661 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 20:29:22,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 20:29:22,720 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;@50bbfef9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 20:29:22,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 20:29:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 35 states have internal predecessors, (40), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 20:29:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 20:29:22,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:29:22,734 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:29:22,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 20:29:22,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:29:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash 71481297, now seen corresponding path program 1 times [2024-11-10 20:29:22,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:29:22,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191801944] [2024-11-10 20:29:22,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:29:22,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:29:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:29:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 20:29:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:29:23,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 20:29:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:29:23,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 20:29:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:29:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 20:29:23,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 20:29:23,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191801944] [2024-11-10 20:29:23,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191801944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:29:23,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:29:23,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:29:23,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524288761] [2024-11-10 20:29:23,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:29:23,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 20:29:23,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 20:29:23,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 20:29:23,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:29:23,194 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 35 states have internal predecessors, (40), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 20:29:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:29:23,266 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2024-11-10 20:29:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 20:29:23,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-10 20:29:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:29:23,275 INFO L225 Difference]: With dead ends: 73 [2024-11-10 20:29:23,275 INFO L226 Difference]: Without dead ends: 30 [2024-11-10 20:29:23,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:29:23,283 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:29:23,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 89 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:29:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-10 20:29:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-10 20:29:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 20:29:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-10 20:29:23,321 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2024-11-10 20:29:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:29:23,322 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-10 20:29:23,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 20:29:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-10 20:29:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 20:29:23,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:29:23,326 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:29:23,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 20:29:23,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 20:29:23,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:29:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -705221325, now seen corresponding path program 1 times [2024-11-10 20:29:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:29:23,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133616066] [2024-11-10 20:29:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:29:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:29:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:29:23,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 20:29:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:29:23,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 20:29:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:29:23,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 20:29:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:29:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 20:29:23,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 20:29:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133616066] [2024-11-10 20:29:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133616066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:29:23,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:29:23,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:29:23,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42118843] [2024-11-10 20:29:23,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:29:23,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 20:29:23,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 20:29:23,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 20:29:23,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:29:23,582 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 20:29:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:29:23,603 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-10 20:29:23,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 20:29:23,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-11-10 20:29:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:29:23,605 INFO L225 Difference]: With dead ends: 30 [2024-11-10 20:29:23,605 INFO L226 Difference]: Without dead ends: 28 [2024-11-10 20:29:23,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:29:23,607 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:29:23,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 39 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:29:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-10 20:29:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-10 20:29:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 20:29:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-10 20:29:23,614 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2024-11-10 20:29:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:29:23,617 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-10 20:29:23,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 20:29:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-10 20:29:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 20:29:23,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:29:23,619 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:29:23,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 20:29:23,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 20:29:23,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:29:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash -387024608, now seen corresponding path program 1 times [2024-11-10 20:29:23,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:29:23,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56783007] [2024-11-10 20:29:23,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:29:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:29:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:29:23,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 20:29:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:29:23,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 20:29:23,699 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 20:29:23,700 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-10 20:29:23,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-10 20:29:23,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-10 20:29:23,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-10 20:29:23,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 20:29:23,704 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 20:29:23,732 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 20:29:23,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:29:23 BoogieIcfgContainer [2024-11-10 20:29:23,735 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 20:29:23,736 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 20:29:23,736 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 20:29:23,737 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 20:29:23,737 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:29:22" (3/4) ... [2024-11-10 20:29:23,739 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 20:29:23,741 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 20:29:23,741 INFO L158 Benchmark]: Toolchain (without parser) took 2666.80ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 75.7MB in the beginning and 119.2MB in the end (delta: -43.5MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2024-11-10 20:29:23,742 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 134.2MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:29:23,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1052.61ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 75.4MB in the beginning and 106.3MB in the end (delta: -30.9MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-11-10 20:29:23,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.08ms. Allocated memory is still 180.4MB. Free memory was 106.3MB in the beginning and 102.4MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:29:23,743 INFO L158 Benchmark]: Boogie Preprocessor took 46.53ms. Allocated memory is still 180.4MB. Free memory was 102.4MB in the beginning and 100.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:29:23,744 INFO L158 Benchmark]: IcfgBuilder took 387.91ms. Allocated memory is still 180.4MB. Free memory was 100.3MB in the beginning and 84.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 20:29:23,744 INFO L158 Benchmark]: TraceAbstraction took 1100.50ms. Allocated memory is still 180.4MB. Free memory was 84.6MB in the beginning and 120.3MB in the end (delta: -35.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:29:23,745 INFO L158 Benchmark]: Witness Printer took 4.57ms. Allocated memory is still 180.4MB. Free memory was 120.3MB in the beginning and 119.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:29:23,747 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.19ms. Allocated memory is still 134.2MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1052.61ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 75.4MB in the beginning and 106.3MB in the end (delta: -30.9MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.08ms. Allocated memory is still 180.4MB. Free memory was 106.3MB in the beginning and 102.4MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.53ms. Allocated memory is still 180.4MB. Free memory was 102.4MB in the beginning and 100.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 387.91ms. Allocated memory is still 180.4MB. Free memory was 100.3MB in the beginning and 84.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1100.50ms. Allocated memory is still 180.4MB. Free memory was 84.6MB in the beginning and 120.3MB in the end (delta: -35.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.57ms. Allocated memory is still 180.4MB. Free memory was 120.3MB in the beginning and 119.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1595, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1595] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1595] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1596] CALL CWE190_Integer_Overflow__int_fgets_preinc_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 47 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 75 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred 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.4s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 70 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 20:29:23,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_preinc_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b91dae833bbe914f6db858614925f2e5ed6a0d4828d26d06ca221fba91b27025 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 20:29:25,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 20:29:26,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-10 20:29:26,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 20:29:26,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 20:29:26,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-10 20:29:26,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 20:29:26,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 20:29:26,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 20:29:26,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 20:29:26,070 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 20:29:26,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 20:29:26,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 20:29:26,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 20:29:26,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 20:29:26,074 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 20:29:26,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 20:29:26,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 20:29:26,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 20:29:26,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 20:29:26,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 20:29:26,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 20:29:26,076 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 20:29:26,077 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 20:29:26,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 20:29:26,077 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 20:29:26,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 20:29:26,077 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 20:29:26,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 20:29:26,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 20:29:26,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 20:29:26,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 20:29:26,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 20:29:26,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 20:29:26,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:29:26,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 20:29:26,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 20:29:26,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 20:29:26,082 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 20:29:26,082 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 20:29:26,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 20:29:26,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 20:29:26,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 20:29:26,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 20:29:26,084 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 -> b91dae833bbe914f6db858614925f2e5ed6a0d4828d26d06ca221fba91b27025 [2024-11-10 20:29:26,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 20:29:26,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 20:29:26,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 20:29:26,465 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 20:29:26,466 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 20:29:26,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2024-11-10 20:29:28,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 20:29:28,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 20:29:28,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2024-11-10 20:29:28,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b23425e/6cbb28610f6549ba8d3edeb3037ceb2c/FLAGdbe94aadc [2024-11-10 20:29:28,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b23425e/6cbb28610f6549ba8d3edeb3037ceb2c [2024-11-10 20:29:28,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 20:29:28,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 20:29:28,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 20:29:28,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 20:29:28,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 20:29:28,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:29:28" (1/1) ... [2024-11-10 20:29:28,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@493c0d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:28, skipping insertion in model container [2024-11-10 20:29:28,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:29:28" (1/1) ... [2024-11-10 20:29:28,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 20:29:29,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:29:29,466 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 20:29:29,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:29:29,717 INFO L204 MainTranslator]: Completed translation [2024-11-10 20:29:29,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:29 WrapperNode [2024-11-10 20:29:29,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 20:29:29,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 20:29:29,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 20:29:29,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 20:29:29,727 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:29:29" (1/1) ... [2024-11-10 20:29:29,757 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:29:29" (1/1) ... [2024-11-10 20:29:29,781 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2024-11-10 20:29:29,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 20:29:29,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 20:29:29,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 20:29:29,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 20:29:29,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:29" (1/1) ... [2024-11-10 20:29:29,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:29" (1/1) ... [2024-11-10 20:29:29,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:29" (1/1) ... [2024-11-10 20:29:29,816 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:29:29,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:29" (1/1) ... [2024-11-10 20:29:29,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:29" (1/1) ... [2024-11-10 20:29:29,826 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:29" (1/1) ... [2024-11-10 20:29:29,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:29" (1/1) ... [2024-11-10 20:29:29,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:29" (1/1) ... [2024-11-10 20:29:29,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:29" (1/1) ... [2024-11-10 20:29:29,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 20:29:29,834 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 20:29:29,834 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 20:29:29,834 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 20:29:29,835 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:29" (1/1) ... [2024-11-10 20:29:29,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:29:29,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 20:29:29,866 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:29:29,868 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:29:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-10 20:29:29,907 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-10 20:29:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-10 20:29:29,908 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-10 20:29:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 20:29:29,908 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 20:29:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 20:29:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 20:29:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 20:29:29,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 20:29:30,076 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 20:29:30,078 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 20:29:30,128 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520: havoc #t~nondet83; [2024-11-10 20:29:30,265 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 20:29:30,265 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 20:29:30,277 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 20:29:30,277 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 20:29:30,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:29:30 BoogieIcfgContainer [2024-11-10 20:29:30,278 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 20:29:30,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 20:29:30,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 20:29:30,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 20:29:30,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:29:28" (1/3) ... [2024-11-10 20:29:30,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22033243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:29:30, skipping insertion in model container [2024-11-10 20:29:30,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:29:29" (2/3) ... [2024-11-10 20:29:30,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22033243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:29:30, skipping insertion in model container [2024-11-10 20:29:30,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:29:30" (3/3) ... [2024-11-10 20:29:30,288 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_12_bad.i [2024-11-10 20:29:30,302 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 20:29:30,303 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 20:29:30,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 20:29:30,376 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;@59773578, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 20:29:30,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 20:29:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 20:29:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 20:29:30,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:29:30,388 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:29:30,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 20:29:30,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:29:30,397 INFO L85 PathProgramCache]: Analyzing trace with hash 383693461, now seen corresponding path program 1 times [2024-11-10 20:29:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:29:30,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355446926] [2024-11-10 20:29:30,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:29:30,411 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:29:30,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:29:30,414 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:29:30,416 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:29:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:29:30,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 20:29:30,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 20:29:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 20:29:30,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 20:29:30,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 20:29:30,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355446926] [2024-11-10 20:29:30,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355446926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:29:30,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:29:30,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 20:29:30,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930125537] [2024-11-10 20:29:30,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:29:30,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 20:29:30,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 20:29:30,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 20:29:30,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 20:29:30,604 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 20:29:30,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:29:30,624 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2024-11-10 20:29:30,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 20:29:30,625 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2024-11-10 20:29:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:29:30,631 INFO L225 Difference]: With dead ends: 45 [2024-11-10 20:29:30,631 INFO L226 Difference]: Without dead ends: 26 [2024-11-10 20:29:30,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 20:29:30,637 INFO L432 NwaCegarLoop]: 52 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, 52 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:29:30,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:29:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-10 20:29:30,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-10 20:29:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 20:29:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-10 20:29:30,670 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2024-11-10 20:29:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:29:30,671 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-10 20:29:30,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 20:29:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-10 20:29:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 20:29:30,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:29:30,672 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:29:30,678 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 (2)] Forceful destruction successful, exit code 0 [2024-11-10 20:29:30,877 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:29:30,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 20:29:30,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:29:30,878 INFO L85 PathProgramCache]: Analyzing trace with hash -990404610, now seen corresponding path program 1 times [2024-11-10 20:29:30,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:29:30,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154059180] [2024-11-10 20:29:30,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:29:30,879 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:29:30,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:29:30,880 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:29:30,882 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:29:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:29:30,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 20:29:30,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 20:29:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 20:29:31,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 20:29:31,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 20:29:31,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154059180] [2024-11-10 20:29:31,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154059180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:29:31,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:29:31,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:29:31,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102952306] [2024-11-10 20:29:31,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:29:31,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 20:29:31,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 20:29:31,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 20:29:31,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:29:31,011 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 20:29:31,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:29:31,038 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-10 20:29:31,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 20:29:31,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-10 20:29:31,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:29:31,040 INFO L225 Difference]: With dead ends: 35 [2024-11-10 20:29:31,040 INFO L226 Difference]: Without dead ends: 26 [2024-11-10 20:29:31,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:29:31,042 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:29:31,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:29:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-10 20:29:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-10 20:29:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 20:29:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-10 20:29:31,049 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2024-11-10 20:29:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:29:31,050 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-10 20:29:31,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 20:29:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-10 20:29:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 20:29:31,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:29:31,058 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:29:31,063 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:29:31,258 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:29:31,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 20:29:31,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:29:31,259 INFO L85 PathProgramCache]: Analyzing trace with hash 63587072, now seen corresponding path program 1 times [2024-11-10 20:29:31,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:29:31,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849413359] [2024-11-10 20:29:31,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:29:31,260 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:29:31,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:29:31,263 INFO L229 MonitoredProcess]: Starting monitored process 4 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:29:31,265 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 (4)] Waiting until timeout for monitored process [2024-11-10 20:29:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:29:31,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 20:29:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:29:31,435 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 20:29:31,436 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 20:29:31,437 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-10 20:29:31,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-10 20:29:31,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-10 20:29:31,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-10 20:29:31,446 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 (4)] Forceful destruction successful, exit code 0 [2024-11-10 20:29:31,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:29:31,644 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 20:29:31,678 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 20:29:31,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:29:31 BoogieIcfgContainer [2024-11-10 20:29:31,681 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 20:29:31,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 20:29:31,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 20:29:31,682 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 20:29:31,683 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:29:30" (3/4) ... [2024-11-10 20:29:31,686 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 20:29:31,687 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 20:29:31,688 INFO L158 Benchmark]: Toolchain (without parser) took 3199.33ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 33.3MB in the beginning and 57.8MB in the end (delta: -24.6MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-10 20:29:31,688 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 48.2MB. Free memory is still 28.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:29:31,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1228.60ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 33.1MB in the beginning and 72.9MB in the end (delta: -39.8MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-11-10 20:29:31,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.99ms. Allocated memory is still 100.7MB. Free memory was 72.9MB in the beginning and 70.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:29:31,690 INFO L158 Benchmark]: Boogie Preprocessor took 49.78ms. Allocated memory is still 100.7MB. Free memory was 70.1MB in the beginning and 67.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:29:31,690 INFO L158 Benchmark]: IcfgBuilder took 444.39ms. Allocated memory is still 100.7MB. Free memory was 67.2MB in the beginning and 49.8MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 20:29:31,690 INFO L158 Benchmark]: TraceAbstraction took 1400.91ms. Allocated memory is still 100.7MB. Free memory was 49.2MB in the beginning and 57.8MB in the end (delta: -8.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:29:31,691 INFO L158 Benchmark]: Witness Printer took 5.38ms. Allocated memory is still 100.7MB. Free memory is still 57.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:29:31,697 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 48.2MB. Free memory is still 28.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1228.60ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 33.1MB in the beginning and 72.9MB in the end (delta: -39.8MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.99ms. Allocated memory is still 100.7MB. Free memory was 72.9MB in the beginning and 70.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.78ms. Allocated memory is still 100.7MB. Free memory was 70.1MB in the beginning and 67.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 444.39ms. Allocated memory is still 100.7MB. Free memory was 67.2MB in the beginning and 49.8MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1400.91ms. Allocated memory is still 100.7MB. Free memory was 49.2MB in the beginning and 57.8MB in the end (delta: -8.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.38ms. Allocated memory is still 100.7MB. Free memory is still 57.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1595, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1595] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1595] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1596] CALL CWE190_Integer_Overflow__int_fgets_preinc_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 79 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 45 SizeOfPredicates, 0 NumberOfNonLiveVariables, 123 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 20:29:31,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample