./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f 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_add_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 f9ab0f28220d4c56d024e1d051466cfff21d1d545d8edb81faa19718425e9629 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 18:38:00,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 18:38:00,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 18:38:00,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 18:38:00,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 18:38:00,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 18:38:00,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 18:38:00,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 18:38:00,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 18:38:00,918 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 18:38:00,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 18:38:00,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 18:38:00,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 18:38:00,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 18:38:00,919 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 18:38:00,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 18:38:00,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 18:38:00,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 18:38:00,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 18:38:00,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 18:38:00,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 18:38:00,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 18:38:00,921 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 18:38:00,921 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 18:38:00,922 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 18:38:00,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 18:38:00,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 18:38:00,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 18:38:00,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 18:38:00,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 18:38:00,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 18:38:00,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:38:00,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 18:38:00,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 18:38:00,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 18:38:00,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 18:38:00,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 18:38:00,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 18:38:00,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 18:38:00,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 18:38:00,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 18:38:00,926 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 -> f9ab0f28220d4c56d024e1d051466cfff21d1d545d8edb81faa19718425e9629 [2024-11-12 18:38:01,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 18:38:01,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 18:38:01,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 18:38:01,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 18:38:01,190 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 18:38:01,191 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_add_12_bad.i [2024-11-12 18:38:02,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 18:38:02,856 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 18:38:02,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2024-11-12 18:38:02,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/581600fc6/d8741ba2bd0545019c8a0bff043c66d8/FLAGc5767123d [2024-11-12 18:38:03,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/581600fc6/d8741ba2bd0545019c8a0bff043c66d8 [2024-11-12 18:38:03,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 18:38:03,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 18:38:03,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 18:38:03,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 18:38:03,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 18:38:03,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:38:03" (1/1) ... [2024-11-12 18:38:03,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34edbf93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:03, skipping insertion in model container [2024-11-12 18:38:03,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:38:03" (1/1) ... [2024-11-12 18:38:03,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 18:38:03,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:38:03,840 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 18:38:03,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:38:04,153 INFO L204 MainTranslator]: Completed translation [2024-11-12 18:38:04,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04 WrapperNode [2024-11-12 18:38:04,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 18:38:04,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 18:38:04,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 18:38:04,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 18:38:04,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04" (1/1) ... [2024-11-12 18:38:04,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04" (1/1) ... [2024-11-12 18:38:04,265 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-11-12 18:38:04,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 18:38:04,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 18:38:04,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 18:38:04,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 18:38:04,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04" (1/1) ... [2024-11-12 18:38:04,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04" (1/1) ... [2024-11-12 18:38:04,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04" (1/1) ... [2024-11-12 18:38:04,319 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-12 18:38:04,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04" (1/1) ... [2024-11-12 18:38:04,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04" (1/1) ... [2024-11-12 18:38:04,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04" (1/1) ... [2024-11-12 18:38:04,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04" (1/1) ... [2024-11-12 18:38:04,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04" (1/1) ... [2024-11-12 18:38:04,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04" (1/1) ... [2024-11-12 18:38:04,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 18:38:04,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 18:38:04,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 18:38:04,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 18:38:04,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04" (1/1) ... [2024-11-12 18:38:04,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:38:04,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 18:38:04,364 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-12 18:38:04,366 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-12 18:38:04,403 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-12 18:38:04,403 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-12 18:38:04,403 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-12 18:38:04,403 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-12 18:38:04,403 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 18:38:04,403 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 18:38:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 18:38:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 18:38:04,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 18:38:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 18:38:04,517 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 18:38:04,519 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 18:38:04,607 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-12 18:38:04,607 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 18:38:04,622 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 18:38:04,623 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 18:38:04,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:38:04 BoogieIcfgContainer [2024-11-12 18:38:04,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 18:38:04,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 18:38:04,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 18:38:04,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 18:38:04,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:38:03" (1/3) ... [2024-11-12 18:38:04,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142ccfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:38:04, skipping insertion in model container [2024-11-12 18:38:04,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:04" (2/3) ... [2024-11-12 18:38:04,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142ccfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:38:04, skipping insertion in model container [2024-11-12 18:38:04,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:38:04" (3/3) ... [2024-11-12 18:38:04,633 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2024-11-12 18:38:04,650 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 18:38:04,650 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-12 18:38:04,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 18:38:04,694 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;@350a85c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 18:38:04,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 18:38:04,699 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-12 18:38:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 18:38:04,704 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:38:04,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:38:04,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 18:38:04,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:38:04,709 INFO L85 PathProgramCache]: Analyzing trace with hash -786218938, now seen corresponding path program 1 times [2024-11-12 18:38:04,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:38:04,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288286201] [2024-11-12 18:38:04,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:38:04,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:38:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:38:05,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 18:38:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:38:05,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 18:38:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:38:05,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 18:38:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:38:05,100 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-12 18:38:05,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 18:38:05,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288286201] [2024-11-12 18:38:05,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288286201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:38:05,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:38:05,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 18:38:05,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922750133] [2024-11-12 18:38:05,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:38:05,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 18:38:05,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 18:38:05,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 18:38:05,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:38:05,132 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 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-12 18:38:05,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:38:05,173 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2024-11-12 18:38:05,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 18:38:05,178 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-12 18:38:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:38:05,183 INFO L225 Difference]: With dead ends: 69 [2024-11-12 18:38:05,183 INFO L226 Difference]: Without dead ends: 30 [2024-11-12 18:38:05,186 INFO L434 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-12 18:38:05,189 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:38:05,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 98 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:38:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-12 18:38:05,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-12 18:38:05,218 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-12 18:38:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-12 18:38:05,221 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2024-11-12 18:38:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:38:05,222 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-12 18:38:05,222 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-12 18:38:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-12 18:38:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 18:38:05,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:38:05,225 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:38:05,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 18:38:05,226 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-12 18:38:05,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:38:05,228 INFO L85 PathProgramCache]: Analyzing trace with hash -369234517, now seen corresponding path program 1 times [2024-11-12 18:38:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:38:05,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760851932] [2024-11-12 18:38:05,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:38:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:38:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:38:05,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 18:38:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:38:05,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 18:38:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:38:05,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 18:38:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:38:05,373 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-12 18:38:05,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 18:38:05,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760851932] [2024-11-12 18:38:05,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760851932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:38:05,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:38:05,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 18:38:05,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769570562] [2024-11-12 18:38:05,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:38:05,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 18:38:05,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 18:38:05,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 18:38:05,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:38:05,380 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-12 18:38:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:38:05,399 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-12 18:38:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 18:38:05,399 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-12 18:38:05,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:38:05,400 INFO L225 Difference]: With dead ends: 30 [2024-11-12 18:38:05,400 INFO L226 Difference]: Without dead ends: 28 [2024-11-12 18:38:05,400 INFO L434 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-12 18:38:05,401 INFO L435 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-12 18:38:05,401 INFO L436 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-12 18:38:05,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-12 18:38:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-12 18:38:05,409 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-12 18:38:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-12 18:38:05,412 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2024-11-12 18:38:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:38:05,413 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-12 18:38:05,413 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-12 18:38:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-12 18:38:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 18:38:05,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:38:05,414 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:38:05,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 18:38:05,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 18:38:05,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:38:05,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1438631933, now seen corresponding path program 1 times [2024-11-12 18:38:05,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:38:05,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10756670] [2024-11-12 18:38:05,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:38:05,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:38:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:38:05,453 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 18:38:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:38:05,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 18:38:05,493 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 18:38:05,495 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-12 18:38:05,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-12 18:38:05,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-12 18:38:05,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-12 18:38:05,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 18:38:05,501 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 18:38:05,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 18:38:05,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:38:05 BoogieIcfgContainer [2024-11-12 18:38:05,532 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 18:38:05,532 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 18:38:05,532 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 18:38:05,533 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 18:38:05,533 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:38:04" (3/4) ... [2024-11-12 18:38:05,537 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 18:38:05,538 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 18:38:05,538 INFO L158 Benchmark]: Toolchain (without parser) took 2368.88ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 68.9MB in the beginning and 137.4MB in the end (delta: -68.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-12 18:38:05,538 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:38:05,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 983.86ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 68.9MB in the beginning and 144.8MB in the end (delta: -75.8MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2024-11-12 18:38:05,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.66ms. Allocated memory is still 218.1MB. Free memory was 144.8MB in the beginning and 141.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:38:05,539 INFO L158 Benchmark]: Boogie Preprocessor took 63.22ms. Allocated memory is still 218.1MB. Free memory was 141.7MB in the beginning and 139.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:38:05,539 INFO L158 Benchmark]: RCFGBuilder took 293.90ms. Allocated memory is still 218.1MB. Free memory was 139.6MB in the beginning and 123.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 18:38:05,540 INFO L158 Benchmark]: TraceAbstraction took 906.83ms. Allocated memory is still 218.1MB. Free memory was 122.8MB in the beginning and 137.4MB in the end (delta: -14.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:38:05,540 INFO L158 Benchmark]: Witness Printer took 5.47ms. Allocated memory is still 218.1MB. Free memory was 137.4MB in the beginning and 137.4MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:38:05,543 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.15ms. Allocated memory is still 142.6MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 983.86ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 68.9MB in the beginning and 144.8MB in the end (delta: -75.8MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.66ms. Allocated memory is still 218.1MB. Free memory was 144.8MB in the beginning and 141.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.22ms. Allocated memory is still 218.1MB. Free memory was 141.7MB in the beginning and 139.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 293.90ms. Allocated memory is still 218.1MB. Free memory was 139.6MB in the beginning and 123.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 906.83ms. Allocated memory is still 218.1MB. Free memory was 122.8MB in the beginning and 137.4MB in the end (delta: -14.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.47ms. Allocated memory is still 218.1MB. Free memory was 137.4MB in the beginning and 137.4MB in the end (delta: 2.0kB). 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 1593, 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] [L1593] 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) [L1593] 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] [L1594] CALL CWE190_Integer_Overflow__int_fgets_add_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 + 1 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: 1581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: 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: 0.8s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 137 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 84 mSDtfsCounter, 27 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=45occurred 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-12 18:38:05,568 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_add_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 f9ab0f28220d4c56d024e1d051466cfff21d1d545d8edb81faa19718425e9629 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 18:38:08,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 18:38:08,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-12 18:38:08,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 18:38:08,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 18:38:08,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-12 18:38:08,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 18:38:08,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 18:38:08,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 18:38:08,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 18:38:08,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 18:38:08,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 18:38:08,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 18:38:08,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 18:38:08,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 18:38:08,145 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 18:38:08,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 18:38:08,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 18:38:08,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 18:38:08,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 18:38:08,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 18:38:08,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 18:38:08,147 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 18:38:08,147 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 18:38:08,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 18:38:08,148 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 18:38:08,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 18:38:08,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 18:38:08,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 18:38:08,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 18:38:08,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 18:38:08,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 18:38:08,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 18:38:08,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 18:38:08,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:38:08,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 18:38:08,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 18:38:08,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 18:38:08,151 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 18:38:08,152 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 18:38:08,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 18:38:08,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 18:38:08,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 18:38:08,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 18:38:08,153 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 -> f9ab0f28220d4c56d024e1d051466cfff21d1d545d8edb81faa19718425e9629 [2024-11-12 18:38:08,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 18:38:08,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 18:38:08,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 18:38:08,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 18:38:08,469 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 18:38:08,470 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_add_12_bad.i [2024-11-12 18:38:09,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 18:38:10,172 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 18:38:10,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2024-11-12 18:38:10,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5bab935f/8f381351563f4c4988350d7571d5e1cb/FLAG6a0418f24 [2024-11-12 18:38:10,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5bab935f/8f381351563f4c4988350d7571d5e1cb [2024-11-12 18:38:10,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 18:38:10,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 18:38:10,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 18:38:10,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 18:38:10,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 18:38:10,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:38:10" (1/1) ... [2024-11-12 18:38:10,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f46eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:10, skipping insertion in model container [2024-11-12 18:38:10,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:38:10" (1/1) ... [2024-11-12 18:38:10,524 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 18:38:11,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:38:11,210 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 18:38:11,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:38:11,373 INFO L204 MainTranslator]: Completed translation [2024-11-12 18:38:11,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11 WrapperNode [2024-11-12 18:38:11,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 18:38:11,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 18:38:11,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 18:38:11,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 18:38:11,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11" (1/1) ... [2024-11-12 18:38:11,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11" (1/1) ... [2024-11-12 18:38:11,417 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2024-11-12 18:38:11,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 18:38:11,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 18:38:11,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 18:38:11,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 18:38:11,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11" (1/1) ... [2024-11-12 18:38:11,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11" (1/1) ... [2024-11-12 18:38:11,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11" (1/1) ... [2024-11-12 18:38:11,445 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-12 18:38:11,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11" (1/1) ... [2024-11-12 18:38:11,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11" (1/1) ... [2024-11-12 18:38:11,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11" (1/1) ... [2024-11-12 18:38:11,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11" (1/1) ... [2024-11-12 18:38:11,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11" (1/1) ... [2024-11-12 18:38:11,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11" (1/1) ... [2024-11-12 18:38:11,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 18:38:11,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 18:38:11,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 18:38:11,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 18:38:11,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11" (1/1) ... [2024-11-12 18:38:11,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:38:11,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 18:38:11,494 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-12 18:38:11,500 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-12 18:38:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-12 18:38:11,534 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-12 18:38:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-12 18:38:11,535 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-12 18:38:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 18:38:11,535 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 18:38:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 18:38:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 18:38:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 18:38:11,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 18:38:11,643 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 18:38:11,644 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 18:38:11,826 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 18:38:11,826 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 18:38:11,840 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 18:38:11,840 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 18:38:11,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:38:11 BoogieIcfgContainer [2024-11-12 18:38:11,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 18:38:11,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 18:38:11,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 18:38:11,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 18:38:11,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:38:10" (1/3) ... [2024-11-12 18:38:11,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f1a1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:38:11, skipping insertion in model container [2024-11-12 18:38:11,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:11" (2/3) ... [2024-11-12 18:38:11,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f1a1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:38:11, skipping insertion in model container [2024-11-12 18:38:11,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:38:11" (3/3) ... [2024-11-12 18:38:11,849 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2024-11-12 18:38:11,862 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 18:38:11,862 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-12 18:38:11,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 18:38:11,921 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;@125d624b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 18:38:11,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 18:38:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 18:38:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 18:38:11,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:38:11,930 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:38:11,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 18:38:11,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:38:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1142699916, now seen corresponding path program 1 times [2024-11-12 18:38:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:38:11,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267397802] [2024-11-12 18:38:11,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:38:11,948 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-12 18:38:11,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:38:11,953 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-12 18:38:11,954 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-12 18:38:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:38:12,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 18:38:12,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 18:38:12,090 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-12 18:38:12,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 18:38:12,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 18:38:12,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267397802] [2024-11-12 18:38:12,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267397802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:38:12,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:38:12,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 18:38:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076648228] [2024-11-12 18:38:12,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:38:12,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 18:38:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 18:38:12,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 18:38:12,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 18:38:12,116 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 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-12 18:38:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:38:12,131 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-11-12 18:38:12,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 18:38:12,133 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-12 18:38:12,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:38:12,138 INFO L225 Difference]: With dead ends: 43 [2024-11-12 18:38:12,138 INFO L226 Difference]: Without dead ends: 26 [2024-11-12 18:38:12,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 18:38:12,145 INFO L435 NwaCegarLoop]: 50 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, 50 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-12 18:38:12,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:38:12,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-12 18:38:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-12 18:38:12,170 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-12 18:38:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-12 18:38:12,172 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2024-11-12 18:38:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:38:12,173 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-12 18:38:12,173 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-12 18:38:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-12 18:38:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 18:38:12,174 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:38:12,174 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:38:12,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 18:38:12,377 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-12 18:38:12,378 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-12 18:38:12,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:38:12,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1063959098, now seen corresponding path program 1 times [2024-11-12 18:38:12,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:38:12,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028391460] [2024-11-12 18:38:12,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:38:12,380 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-12 18:38:12,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:38:12,381 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-12 18:38:12,383 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-12 18:38:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:38:12,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 18:38:12,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 18:38:12,475 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-12 18:38:12,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 18:38:12,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 18:38:12,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028391460] [2024-11-12 18:38:12,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028391460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:38:12,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:38:12,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 18:38:12,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003507106] [2024-11-12 18:38:12,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:38:12,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 18:38:12,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 18:38:12,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 18:38:12,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:38:12,478 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-12 18:38:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:38:12,493 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-12 18:38:12,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 18:38:12,494 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-12 18:38:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:38:12,494 INFO L225 Difference]: With dead ends: 35 [2024-11-12 18:38:12,494 INFO L226 Difference]: Without dead ends: 26 [2024-11-12 18:38:12,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:38:12,495 INFO L435 NwaCegarLoop]: 33 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, 55 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-12 18:38:12,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:38:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-12 18:38:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-12 18:38:12,499 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-12 18:38:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-12 18:38:12,499 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2024-11-12 18:38:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:38:12,500 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-12 18:38:12,500 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-12 18:38:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-12 18:38:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 18:38:12,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:38:12,501 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:38:12,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 18:38:12,701 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-12 18:38:12,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 18:38:12,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:38:12,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1438631169, now seen corresponding path program 1 times [2024-11-12 18:38:12,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:38:12,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504495014] [2024-11-12 18:38:12,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:38:12,704 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-12 18:38:12,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:38:12,710 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-12 18:38:12,717 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-12 18:38:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:38:12,803 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 18:38:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:38:12,844 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 18:38:12,844 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 18:38:12,845 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-12 18:38:12,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-12 18:38:12,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-12 18:38:12,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-12 18:38:12,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 18:38:13,049 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-12 18:38:13,052 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 18:38:13,072 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 18:38:13,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:38:13 BoogieIcfgContainer [2024-11-12 18:38:13,074 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 18:38:13,075 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 18:38:13,075 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 18:38:13,075 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 18:38:13,076 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:38:11" (3/4) ... [2024-11-12 18:38:13,078 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 18:38:13,079 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 18:38:13,079 INFO L158 Benchmark]: Toolchain (without parser) took 2617.90ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 34.1MB in the beginning and 36.8MB in the end (delta: -2.8MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-11-12 18:38:13,080 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory is still 25.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:38:13,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 913.00ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 33.7MB in the beginning and 53.5MB in the end (delta: -19.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-12 18:38:13,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.37ms. Allocated memory is still 88.1MB. Free memory was 53.5MB in the beginning and 50.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:38:13,081 INFO L158 Benchmark]: Boogie Preprocessor took 40.48ms. Allocated memory is still 88.1MB. Free memory was 50.2MB in the beginning and 47.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 18:38:13,081 INFO L158 Benchmark]: RCFGBuilder took 380.94ms. Allocated memory is still 88.1MB. Free memory was 47.2MB in the beginning and 54.1MB in the end (delta: -6.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 18:38:13,081 INFO L158 Benchmark]: TraceAbstraction took 1231.21ms. Allocated memory is still 88.1MB. Free memory was 53.5MB in the beginning and 37.2MB in the end (delta: 16.4MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-11-12 18:38:13,081 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 88.1MB. Free memory was 37.2MB in the beginning and 36.8MB in the end (delta: 331.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:38:13,083 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.17ms. Allocated memory is still 48.2MB. Free memory is still 25.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 913.00ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 33.7MB in the beginning and 53.5MB in the end (delta: -19.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.37ms. Allocated memory is still 88.1MB. Free memory was 53.5MB in the beginning and 50.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.48ms. Allocated memory is still 88.1MB. Free memory was 50.2MB in the beginning and 47.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 380.94ms. Allocated memory is still 88.1MB. Free memory was 47.2MB in the beginning and 54.1MB in the end (delta: -6.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1231.21ms. Allocated memory is still 88.1MB. Free memory was 53.5MB in the beginning and 37.2MB in the end (delta: 16.4MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 88.1MB. Free memory was 37.2MB in the beginning and 36.8MB in the end (delta: 331.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 1593, 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] [L1593] 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) [L1593] 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] [L1594] CALL CWE190_Integer_Overflow__int_fgets_add_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 + 1 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: 1581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 105 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, 83 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=43occurred 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.0s 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-12 18:38:13,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample