./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_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_postinc_08_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0d6fe54a16a6eb14c8cbd9ac8b0fa5290485cd864eb9a1dbcf653bc0aaa31944 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 18:40:07,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 18:40:07,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 18:40:07,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 18:40:07,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 18:40:07,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 18:40:07,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 18:40:07,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 18:40:07,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 18:40:07,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 18:40:07,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 18:40:07,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 18:40:07,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 18:40:07,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 18:40:07,404 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 18:40:07,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 18:40:07,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 18:40:07,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 18:40:07,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 18:40:07,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 18:40:07,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 18:40:07,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 18:40:07,407 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 18:40:07,408 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 18:40:07,408 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 18:40:07,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 18:40:07,408 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 18:40:07,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 18:40:07,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 18:40:07,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 18:40:07,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 18:40:07,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:40:07,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 18:40:07,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 18:40:07,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 18:40:07,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 18:40:07,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 18:40:07,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 18:40:07,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 18:40:07,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 18:40:07,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 18:40:07,414 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 -> 0d6fe54a16a6eb14c8cbd9ac8b0fa5290485cd864eb9a1dbcf653bc0aaa31944 [2024-11-12 18:40:07,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 18:40:07,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 18:40:07,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 18:40:07,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 18:40:07,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 18:40:07,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_bad.i [2024-11-12 18:40:09,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 18:40:09,453 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 18:40:09,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_bad.i [2024-11-12 18:40:09,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3fb4421a/42fd080bcc014ddf90adc1c8db96c605/FLAGbbfe58a89 [2024-11-12 18:40:09,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3fb4421a/42fd080bcc014ddf90adc1c8db96c605 [2024-11-12 18:40:09,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 18:40:09,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 18:40:09,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 18:40:09,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 18:40:09,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 18:40:09,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:40:09" (1/1) ... [2024-11-12 18:40:09,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f45f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:09, skipping insertion in model container [2024-11-12 18:40:09,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:40:09" (1/1) ... [2024-11-12 18:40:09,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 18:40:10,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:40:10,524 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 18:40:10,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:40:10,747 INFO L204 MainTranslator]: Completed translation [2024-11-12 18:40:10,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:10 WrapperNode [2024-11-12 18:40:10,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 18:40:10,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 18:40:10,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 18:40:10,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 18:40:10,756 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:40:10" (1/1) ... [2024-11-12 18:40:10,783 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:40:10" (1/1) ... [2024-11-12 18:40:10,809 INFO L138 Inliner]: procedures = 500, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2024-11-12 18:40:10,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 18:40:10,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 18:40:10,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 18:40:10,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 18:40:10,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:10" (1/1) ... [2024-11-12 18:40:10,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:10" (1/1) ... [2024-11-12 18:40:10,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:10" (1/1) ... [2024-11-12 18:40:10,841 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:40:10,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:10" (1/1) ... [2024-11-12 18:40:10,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:10" (1/1) ... [2024-11-12 18:40:10,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:10" (1/1) ... [2024-11-12 18:40:10,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:10" (1/1) ... [2024-11-12 18:40:10,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:10" (1/1) ... [2024-11-12 18:40:10,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:10" (1/1) ... [2024-11-12 18:40:10,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 18:40:10,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 18:40:10,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 18:40:10,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 18:40:10,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:10" (1/1) ... [2024-11-12 18:40:10,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:40:10,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 18:40:10,899 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:40:10,902 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:40:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 18:40:10,943 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 18:40:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 18:40:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 18:40:10,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 18:40:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-11-12 18:40:10,944 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-11-12 18:40:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 18:40:11,107 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 18:40:11,109 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 18:40:11,235 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-12 18:40:11,236 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 18:40:11,247 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 18:40:11,247 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 18:40:11,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:40:11 BoogieIcfgContainer [2024-11-12 18:40:11,247 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 18:40:11,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 18:40:11,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 18:40:11,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 18:40:11,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:40:09" (1/3) ... [2024-11-12 18:40:11,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbc0b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:40:11, skipping insertion in model container [2024-11-12 18:40:11,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:10" (2/3) ... [2024-11-12 18:40:11,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbc0b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:40:11, skipping insertion in model container [2024-11-12 18:40:11,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:40:11" (3/3) ... [2024-11-12 18:40:11,255 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_08_bad.i [2024-11-12 18:40:11,269 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 18:40:11,269 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 18:40:11,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 18:40:11,323 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;@3c4566e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 18:40:11,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 18:40:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 18:40:11,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 18:40:11,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:40:11,334 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:40:11,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:40:11,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:40:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash -830864152, now seen corresponding path program 1 times [2024-11-12 18:40:11,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:40:11,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729579626] [2024-11-12 18:40:11,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:40:11,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:40:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:40:11,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 18:40:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:40:11,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 18:40:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:40:11,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 18:40:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:40:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 18:40:11,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 18:40:11,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729579626] [2024-11-12 18:40:11,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729579626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 18:40:11,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808004974] [2024-11-12 18:40:11,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:40:11,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 18:40:11,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 18:40:11,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 18:40:11,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 18:40:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:40:11,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 18:40:11,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 18:40:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:40:11,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 18:40:11,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808004974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:40:11,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 18:40:11,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-12 18:40:11,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500800743] [2024-11-12 18:40:11,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:40:11,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 18:40:11,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 18:40:11,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 18:40:11,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 18:40:11,985 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 18:40:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:40:12,027 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2024-11-12 18:40:12,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 18:40:12,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-12 18:40:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:40:12,038 INFO L225 Difference]: With dead ends: 53 [2024-11-12 18:40:12,039 INFO L226 Difference]: Without dead ends: 25 [2024-11-12 18:40:12,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 18:40:12,045 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:40:12,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:40:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-12 18:40:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-12 18:40:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 18:40:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-12 18:40:12,079 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2024-11-12 18:40:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:40:12,080 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-12 18:40:12,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 18:40:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-12 18:40:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 18:40:12,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:40:12,084 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:40:12,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 18:40:12,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-12 18:40:12,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:40:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:40:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1035274573, now seen corresponding path program 1 times [2024-11-12 18:40:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:40:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002436958] [2024-11-12 18:40:12,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:40:12,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:40:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:40:12,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 18:40:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:40:12,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 18:40:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:40:12,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 18:40:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:40:12,542 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:40:12,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 18:40:12,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002436958] [2024-11-12 18:40:12,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002436958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:40:12,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:40:12,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 18:40:12,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816837146] [2024-11-12 18:40:12,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:40:12,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 18:40:12,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 18:40:12,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 18:40:12,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 18:40:12,548 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 18:40:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:40:12,572 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-12 18:40:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 18:40:12,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-11-12 18:40:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:40:12,576 INFO L225 Difference]: With dead ends: 25 [2024-11-12 18:40:12,576 INFO L226 Difference]: Without dead ends: 24 [2024-11-12 18:40:12,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 18:40:12,578 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:40:12,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 60 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:40:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-12 18:40:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-12 18:40:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 18:40:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-12 18:40:12,585 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 23 [2024-11-12 18:40:12,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:40:12,585 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-12 18:40:12,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 18:40:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-12 18:40:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 18:40:12,586 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:40:12,586 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:40:12,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 18:40:12,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:40:12,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:40:12,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2028740759, now seen corresponding path program 1 times [2024-11-12 18:40:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:40:12,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835611889] [2024-11-12 18:40:12,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:40:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:40:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:40:12,630 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 18:40:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:40:12,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 18:40:12,677 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 18:40:12,678 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 18:40:12,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 18:40:12,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 18:40:12,683 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 18:40:12,716 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 18:40:12,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:40:12 BoogieIcfgContainer [2024-11-12 18:40:12,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 18:40:12,723 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 18:40:12,726 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 18:40:12,726 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 18:40:12,727 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:40:11" (3/4) ... [2024-11-12 18:40:12,729 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 18:40:12,731 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 18:40:12,731 INFO L158 Benchmark]: Toolchain (without parser) took 3024.99ms. Allocated memory is still 163.6MB. Free memory was 93.0MB in the beginning and 70.1MB in the end (delta: 22.9MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-11-12 18:40:12,732 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:40:12,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1039.13ms. Allocated memory is still 163.6MB. Free memory was 92.7MB in the beginning and 74.2MB in the end (delta: 18.5MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-11-12 18:40:12,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.51ms. Allocated memory is still 163.6MB. Free memory was 74.2MB in the beginning and 70.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:40:12,733 INFO L158 Benchmark]: Boogie Preprocessor took 43.66ms. Allocated memory is still 163.6MB. Free memory was 70.8MB in the beginning and 68.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:40:12,733 INFO L158 Benchmark]: RCFGBuilder took 392.69ms. Allocated memory is still 163.6MB. Free memory was 68.8MB in the beginning and 54.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 18:40:12,733 INFO L158 Benchmark]: TraceAbstraction took 1472.96ms. Allocated memory is still 163.6MB. Free memory was 54.1MB in the beginning and 70.4MB in the end (delta: -16.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:40:12,734 INFO L158 Benchmark]: Witness Printer took 7.98ms. Allocated memory is still 163.6MB. Free memory was 70.4MB in the beginning and 70.1MB in the end (delta: 223.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:40:12,739 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.16ms. Allocated memory is still 104.9MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1039.13ms. Allocated memory is still 163.6MB. Free memory was 92.7MB in the beginning and 74.2MB in the end (delta: 18.5MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.51ms. Allocated memory is still 163.6MB. Free memory was 74.2MB in the beginning and 70.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.66ms. Allocated memory is still 163.6MB. Free memory was 70.8MB in the beginning and 68.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 392.69ms. Allocated memory is still 163.6MB. Free memory was 68.8MB in the beginning and 54.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1472.96ms. Allocated memory is still 163.6MB. Free memory was 54.1MB in the beginning and 70.4MB in the end (delta: -16.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 7.98ms. Allocated memory is still 163.6MB. Free memory was 70.4MB in the beginning and 70.1MB in the end (delta: 223.9kB). 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: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1566, overapproximation of large string literal at line 1586, overapproximation of fgets at line 1564. 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] [L1586] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1586] 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] [L1587] CALL CWE190_Integer_Overflow__int_fgets_postinc_08_bad() [L1558] int data; [L1559] 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] [L1560] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE staticReturnsTrue() [L1563] 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] [L1564] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1566] data = atoi(inputBuffer) [L1574] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1574] RET staticReturnsTrue() 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] [L1574] COND TRUE staticReturnsTrue() [L1577] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 59 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 8, 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.5s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 98 SizeOfPredicates, 0 NumberOfNonLiveVariables, 96 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 7/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 18:40:12,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0d6fe54a16a6eb14c8cbd9ac8b0fa5290485cd864eb9a1dbcf653bc0aaa31944 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 18:40:14,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 18:40:15,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-12 18:40:15,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 18:40:15,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 18:40:15,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-12 18:40:15,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 18:40:15,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 18:40:15,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 18:40:15,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 18:40:15,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 18:40:15,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 18:40:15,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 18:40:15,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 18:40:15,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 18:40:15,051 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 18:40:15,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 18:40:15,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 18:40:15,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 18:40:15,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 18:40:15,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 18:40:15,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 18:40:15,059 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 18:40:15,059 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 18:40:15,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 18:40:15,060 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 18:40:15,060 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 18:40:15,060 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 18:40:15,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 18:40:15,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 18:40:15,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 18:40:15,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 18:40:15,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 18:40:15,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 18:40:15,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:40:15,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 18:40:15,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 18:40:15,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 18:40:15,065 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 18:40:15,066 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 18:40:15,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 18:40:15,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 18:40:15,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 18:40:15,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 18:40:15,067 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 -> 0d6fe54a16a6eb14c8cbd9ac8b0fa5290485cd864eb9a1dbcf653bc0aaa31944 [2024-11-12 18:40:15,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 18:40:15,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 18:40:15,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 18:40:15,379 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 18:40:15,379 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 18:40:15,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_bad.i [2024-11-12 18:40:17,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 18:40:17,422 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 18:40:17,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_bad.i [2024-11-12 18:40:17,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c69fe965/04ef1adeb1a54a91bf9f9947698c23c2/FLAG5c7e2f532 [2024-11-12 18:40:17,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c69fe965/04ef1adeb1a54a91bf9f9947698c23c2 [2024-11-12 18:40:17,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 18:40:17,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 18:40:17,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 18:40:17,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 18:40:17,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 18:40:17,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:40:17" (1/1) ... [2024-11-12 18:40:17,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5909a047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:17, skipping insertion in model container [2024-11-12 18:40:17,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:40:17" (1/1) ... [2024-11-12 18:40:17,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 18:40:18,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:40:18,326 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 18:40:18,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:40:18,569 INFO L204 MainTranslator]: Completed translation [2024-11-12 18:40:18,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:18 WrapperNode [2024-11-12 18:40:18,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 18:40:18,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 18:40:18,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 18:40:18,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 18:40:18,576 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:40:18" (1/1) ... [2024-11-12 18:40:18,598 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:40:18" (1/1) ... [2024-11-12 18:40:18,618 INFO L138 Inliner]: procedures = 505, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-11-12 18:40:18,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 18:40:18,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 18:40:18,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 18:40:18,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 18:40:18,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:18" (1/1) ... [2024-11-12 18:40:18,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:18" (1/1) ... [2024-11-12 18:40:18,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:18" (1/1) ... [2024-11-12 18:40:18,645 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:40:18,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:18" (1/1) ... [2024-11-12 18:40:18,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:18" (1/1) ... [2024-11-12 18:40:18,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:18" (1/1) ... [2024-11-12 18:40:18,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:18" (1/1) ... [2024-11-12 18:40:18,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:18" (1/1) ... [2024-11-12 18:40:18,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:18" (1/1) ... [2024-11-12 18:40:18,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 18:40:18,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 18:40:18,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 18:40:18,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 18:40:18,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:18" (1/1) ... [2024-11-12 18:40:18,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:40:18,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 18:40:18,696 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:40:18,702 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:40:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 18:40:18,739 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 18:40:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 18:40:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 18:40:18,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 18:40:18,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 18:40:18,740 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-11-12 18:40:18,740 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-11-12 18:40:18,896 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 18:40:18,900 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 18:40:19,022 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 18:40:19,022 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 18:40:19,032 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 18:40:19,032 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 18:40:19,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:40:19 BoogieIcfgContainer [2024-11-12 18:40:19,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 18:40:19,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 18:40:19,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 18:40:19,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 18:40:19,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:40:17" (1/3) ... [2024-11-12 18:40:19,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789eb531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:40:19, skipping insertion in model container [2024-11-12 18:40:19,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:40:18" (2/3) ... [2024-11-12 18:40:19,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789eb531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:40:19, skipping insertion in model container [2024-11-12 18:40:19,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:40:19" (3/3) ... [2024-11-12 18:40:19,040 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_08_bad.i [2024-11-12 18:40:19,055 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 18:40:19,055 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 18:40:19,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 18:40:19,126 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;@7f831bbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 18:40:19,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 18:40:19,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 18:40:19,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 18:40:19,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:40:19,138 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:40:19,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:40:19,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:40:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash -999678610, now seen corresponding path program 1 times [2024-11-12 18:40:19,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:40:19,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951110825] [2024-11-12 18:40:19,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:40:19,161 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:40:19,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:40:19,167 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:40:19,168 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:40:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:40:19,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 18:40:19,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 18:40:19,325 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:40:19,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 18:40:19,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 18:40:19,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951110825] [2024-11-12 18:40:19,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951110825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:40:19,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:40:19,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 18:40:19,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494487893] [2024-11-12 18:40:19,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:40:19,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 18:40:19,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 18:40:19,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 18:40:19,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 18:40:19,359 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 1 states have (on average 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:40:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:40:19,373 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-12 18:40:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 18:40:19,376 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:40:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:40:19,383 INFO L225 Difference]: With dead ends: 30 [2024-11-12 18:40:19,383 INFO L226 Difference]: Without dead ends: 22 [2024-11-12 18:40:19,385 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:40:19,390 INFO L435 NwaCegarLoop]: 35 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, 35 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:40:19,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:40:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-12 18:40:19,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-12 18:40:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 18:40:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-12 18:40:19,421 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 19 [2024-11-12 18:40:19,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:40:19,422 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-12 18:40:19,422 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:40:19,423 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-12 18:40:19,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 18:40:19,424 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:40:19,424 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:40:19,428 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:40:19,625 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:40:19,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:40:19,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:40:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash -925265772, now seen corresponding path program 1 times [2024-11-12 18:40:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:40:19,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154024677] [2024-11-12 18:40:19,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:40:19,628 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:40:19,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:40:19,631 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:40:19,633 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:40:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:40:19,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 18:40:19,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 18:40:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:40:19,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 18:40:19,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 18:40:19,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154024677] [2024-11-12 18:40:19,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154024677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:40:19,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:40:19,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 18:40:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963843454] [2024-11-12 18:40:19,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:40:19,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 18:40:19,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 18:40:19,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 18:40:19,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 18:40:19,828 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 18:40:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:40:19,842 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-12 18:40:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 18:40:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-12 18:40:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:40:19,845 INFO L225 Difference]: With dead ends: 30 [2024-11-12 18:40:19,845 INFO L226 Difference]: Without dead ends: 22 [2024-11-12 18:40:19,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 18:40:19,847 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:40:19,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:40:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-12 18:40:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-12 18:40:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 18:40:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-12 18:40:19,857 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2024-11-12 18:40:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:40:19,857 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-12 18:40:19,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 18:40:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-12 18:40:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 18:40:19,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:40:19,858 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:40:19,867 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:40:20,059 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:40:20,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:40:20,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:40:20,060 INFO L85 PathProgramCache]: Analyzing trace with hash 442157657, now seen corresponding path program 1 times [2024-11-12 18:40:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:40:20,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663569538] [2024-11-12 18:40:20,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:40:20,061 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:40:20,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:40:20,065 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:40:20,083 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:40:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:40:20,183 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 18:40:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:40:20,252 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 18:40:20,252 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 18:40:20,253 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 18:40:20,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 18:40:20,263 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:40:20,456 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:40:20,459 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 18:40:20,487 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 18:40:20,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:40:20 BoogieIcfgContainer [2024-11-12 18:40:20,491 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 18:40:20,491 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 18:40:20,492 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 18:40:20,492 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 18:40:20,492 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:40:19" (3/4) ... [2024-11-12 18:40:20,495 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 18:40:20,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 18:40:20,497 INFO L158 Benchmark]: Toolchain (without parser) took 3020.10ms. Allocated memory was 60.8MB in the beginning and 100.7MB in the end (delta: 39.8MB). Free memory was 38.2MB in the beginning and 53.2MB in the end (delta: -14.9MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-11-12 18:40:20,497 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 46.1MB. Free memory was 26.8MB in the beginning and 26.7MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:40:20,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1091.60ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 38.1MB in the beginning and 39.9MB in the end (delta: -1.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-11-12 18:40:20,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.59ms. Allocated memory is still 81.8MB. Free memory was 39.9MB in the beginning and 36.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:40:20,498 INFO L158 Benchmark]: Boogie Preprocessor took 41.35ms. Allocated memory is still 81.8MB. Free memory was 36.9MB in the beginning and 34.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:40:20,499 INFO L158 Benchmark]: RCFGBuilder took 371.20ms. Allocated memory is still 81.8MB. Free memory was 34.1MB in the beginning and 42.8MB in the end (delta: -8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 18:40:20,499 INFO L158 Benchmark]: TraceAbstraction took 1456.43ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 41.9MB in the beginning and 53.7MB in the end (delta: -11.9MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-11-12 18:40:20,500 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 100.7MB. Free memory was 53.7MB in the beginning and 53.2MB in the end (delta: 560.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:40:20,502 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.91ms. Allocated memory is still 46.1MB. Free memory was 26.8MB in the beginning and 26.7MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1091.60ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 38.1MB in the beginning and 39.9MB in the end (delta: -1.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.59ms. Allocated memory is still 81.8MB. Free memory was 39.9MB in the beginning and 36.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.35ms. Allocated memory is still 81.8MB. Free memory was 36.9MB in the beginning and 34.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.20ms. Allocated memory is still 81.8MB. Free memory was 34.1MB in the beginning and 42.8MB in the end (delta: -8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1456.43ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 41.9MB in the beginning and 53.7MB in the end (delta: -11.9MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 100.7MB. Free memory was 53.7MB in the beginning and 53.2MB in the end (delta: 560.3kB). 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: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1566, overapproximation of large string literal at line 1586, overapproximation of fgets at line 1564. 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] [L1586] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1586] 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] [L1587] CALL CWE190_Integer_Overflow__int_fgets_postinc_08_bad() [L1558] int data; [L1559] 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] [L1560] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE staticReturnsTrue() [L1563] 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] [L1564] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1566] data = atoi(inputBuffer) [L1574] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1574] RET staticReturnsTrue() 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] [L1574] COND TRUE staticReturnsTrue() [L1577] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 59 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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.1s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 43 SizeOfPredicates, 0 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 4 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:40:20,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample